A note on complete sets for the polynomial-time hierarchy

Authors:
Uwe Schöning
Affiliations:
Institut für Informatik der Universität Stuttgart, Stuttgart, Germany
Venue:
ACM SIGACT News
Year:
1981

Citing 1
Cited 0

The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract