Models of lower-bounds proofs (original) (raw)
Related papers
Some elementary proofs of lower-bounds in complexity theory:(prepublication)
On Superlinear Lower Bounds in Complexity Theory
Structure in Complexity Theory Conference, 1995
A Generic Time-Space Lower Bound for Proof Complexity
2008
Simplified lower bounds for propositional proofs
Notre Dame Journal of Formal Logic, Vol. 37, pp. 523-544, 1996
Abstract Some Results in Computational Complexity
2008
Bounded arithmetic, proof complexity and two papers of Parikh
Annals of Pure and Applied Logic, 1999
Resource Bounded Unprovability of Computational Lower Bounds (Part 1)
2003
Lower bounds and the hardness of counting properties
2002
Bounded Arithmetic and Propositional Proof Complexity
Logic of Computation, 1997
A Generalization of a Lower Bound Technique due to Fredman and Saks
Algorithmica, 2001
The Complexity of Propositional Proofs
The Bulletin of Symbolic Logic, 1995
ALGEBRAIC-GEOMETRIC METHODS FOR COMPLEXITY LOWER BOUNDS
2004
Time-space lower bounds for satisfiability
Journal of the ACM ( …, 2005
Complexity of theorem-proving procedures : some general properties
Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, 1974
On the complexity of interactive proofs with bounded communication
Information Processing Letters
On the bounds for the main proof measures in some propositional proof systems
2014
Hardness amplification in proof complexity
Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10, 2010
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1989
On proving circuit lower bounds against the polynomial-time hierarchy
Algorithms from Natural Lower Bounds
Electron. Colloquium Comput. Complex., 2016
Synthese, 1985
Lower bounds for the low hierarchy
Journal of The ACM, 1992
Lower bounds on communication complexity
Information and Computation, 1987
Amplifying lower bounds by means of self-reducibility
Journal of The ACM, 2010
Nonuniform complexity classes specified by lower and upper bounds
RAIRO - Theoretical Informatics and Applications, 1989
Some connections between mathematical logic and complexity theory
1979
Propositional lower bounds: Algorithms and complexity
1999
Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity
A complexity theory for feasible closure properties
1993
Strong time bounds: Non-computable bounds and a hierarchy theorem
Theoretical Computer Science, 1990
Proof verification and the hardness of approximation problems
Journal of the Acm, 1998
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science, 2007
Notes on Computational Complexity Theory CPSC 468/568: Spring 2017