DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Boolean hierarchy
Boolean hierarchy
On Physical Problems That Are Slightly More Difficult Than
The Complexity Zoo
Boolean Hierarchies
The Polynomial Hierarchy
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems – a Survey
Different Approaches to Proof Systems
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
With Probability One, a Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy
A Machine Model for the Complexity of Np-Approximation Problems
Open Problems Column Edited by William Gasarch This
Computational Complexity: a Modern Approach PDF Book
Locating P/Poly Optimally in the Extended Low Hierarchy
Introduction to the Theory of Complexity
The Domatic Number Problem: Boolean Hierarchy Completeness and Exact Exponential-Time Algorithms
Beyond NP: the Work and Legacy of Larry Stockmeyer
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
Strengths and Weaknesses of LH Arithmetic
The Difference and Truth-Table Hierarchies for NP Informatique Théorique Et Applications, Tome 21, No 4 (1987), P
Top View
The Strong Exponential Hierarchy Collapses*
The Random Oracle Hypothesis Is False
The Random Oracle Hypothesis Is False
Introduction to Computational Complexity∗ — Mathematical Programming Glossary Supplement —
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
Beyond NP: the Work and Legacy of Larry Stockmeyer
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
The Complexity of Translationally Invariant Problems Beyond Ground
A Complete Bibliography of Publications in SIAM Journal on Computing
Cryptocomplexity II 1 / 56 Boolean Hierarchy Over NP Problems in DP
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
Exact Complexity of Exact-Four-Colorability
Counting Classes and the Fine Structure Between NC1&
On Truth-Table Reducibility to SAT
Complexity Classifications for Different Equivalence and Audit Problems for Boolean Circuits
PP Is Closed Under Intersection