October 01, 1976 article Open access The polynomial-time hierarchy Theoretical Computer Science DOI: 10.1016/0304-3975(76)90061-x Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 5 stored of 1,302 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access The complexity of blocking all solutions 2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access 1 citations Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization 2025 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs 4 citations The Complexity Classes of Hamming Distance Recoverable Robust Problems 2024 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs 1 citations The trouble with the second quantifier 2021 4OR article Computer Science Complexity and Algorithms in Graphs Open access 27 citations First-Order Model-Checking in Random Graphs and Complex Networks 2020 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access 1 citations 5 results References 0