The Analytic Polynomial-Time Hierarchy (original) (raw)
Related papers
Bounding queries in the analytic polynomial-time hierarchy
Theoretical Computer Science, 1998
A second step toward the strong polynomial-time hierarchy
Mathematical Systems Theory, 1988
On the Expressive Power of Existential Quantification in Polynomial-Time Computability
2000
A syntactic tool for proving hardness in the Second Level of the Polynomial-Time Hierarchy
2017
The Complexity of Propositional Proofs
The Bulletin of Symbolic Logic, 1995
Subclasses of presburger arithmetic and the polynomial-time hierarchy
Theoretical Computer Science, 1988
Bounded Arithmetic and Propositional Proof Complexity
Logic of Computation, 1997
Optimal proof systems for propositional logic and complete sets
Lecture Notes in Computer Science, 1998
The Topology of Provability in Complexity Theory
Journal of Computer and System Sciences, 1986
The Knowledge Complexity of Interactive Proof Systems
SIAM Journal on Computing, 1989
Springer eBooks, 2015
An arithmetic for non-size-increasing polynomial-time computation
Theoretical Computer Science, 2004
Algebraic methods for interactive proof systems
Journal of the ACM, 1992
A note on polynomial time computable arithmetic
1990
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets
Lecture Notes in Computer Science, 2009
Relations between the Proof Complexities in Frege Systems, Deep-Inference Proof Systems KS and еКS
2022
Information and Computation, 1996
Complete proof systems for algebraic simply-typed terms
ACM SIGPLAN Lisp Pointers, 1994
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer …, 2007
Clause Set Structures and Polynomial-Time SAT-Decidable Classes
2007
Investigations into the complexity of some propositional calculi
University of Oxford, PRG technical monographs, 1990
Techniques of computable set theory with applications to proof verification
Communications on Pure and Applied Mathematics, 1995
Two refinements of the polynomial hierarchy
Lecture Notes in Computer Science, 1994
On the Power of Automata Based Proof Systems
1999
2003
THE POLYNOMIAL HIERARCHY AND INTUITIONISTIC BOUNDED ARITHMETIC
Space Complexity in Propositional Calculus
SIAM Journal on Computing, 2002
A comparison of polynomial time completeness notions
Theoretical Computer Science, 1987
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
On propositional quantifiers in provability logic
1993
The quantifier complexity of polynomial-size iterated definitions in first-order logic
Mathematical Logic Quarterly, 2010
Theoretical Computer Science, 1992
On proving circuit lower bounds against the polynomial-time hierarchy
On relativisation and complexity gap for resolution-based proof systems
Computer Science Logic, 2003
Primitive recursive selection functions for existential assertions over abstract algebras
The Journal of Logic and Algebraic Programming, 2008