Graph Ramsey theory and the polynomial hierarchy

Authors:
Marcus Schaefer
Affiliations:
Department of Computer Science, University of Chicago, 1100 East 58th Street, Chicago, Illinois
Venue:
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Year:
1999

Citing 7
Cited 3

Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is &Sgr;p-2--complete

Theoretical Computer Science
The complexity of combinatorial problems with succinct input representation

Acta Informatica
Equivalences Among Relational Expressions with the Union and Difference Operators

Journal of the ACM (JACM)
The Minimization Problem for Boolean Formulas

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The Minimum Equivalent DNF Problem and Shortest Implicants

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimizing TRIEs for ordered pattern matching is /spl Pi//sub 2//sup P/-complete

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
The Boolean isomorphism problem

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

SIGACT news complexity theory comun 37

ACM SIGACT News
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete

Theoretical Computer Science
Randomness and completeness in computational complexity

Randomness and completeness in computational complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract