The Complexity of Resource-Bounded Propositional Proofs

The Complexity of Resource-Bounded Propositional Proofs (2001)

Cached

Download Links

[www.cse.ucsc.edu]

by Albert Atserias

Citations:

2 - 0 self

BibTeX

@MISC{Atserias01thecomplexity,
    author = {Albert Atserias},
    title = {The Complexity of Resource-Bounded Propositional Proofs},
    year = {2001}
}

Bookmark

OpenURL

Abstract

Propositional Proof Complexity is an active area of research whose main focus is the study of the length of proofs in propositional logic. There are several motivations for such a study, the main of which is probably its connection to the P vs NP problem in Computational Complexity. The experience

Citations

1346	Renyi A: On the evolution of random graphs - Erdos - 1960
409	The complexity of theorem proving procedures - Cook - 1971
315	The Complexity of Boolean Functions - Wegener - 1987
285	The Relative Efficiency of Propositional Proof Systems - Cook, Reckhow - 1979
242	The Intractability of Resolution - Haken - 1985
211	Cones of matrices and set-functions and 0 , 1 optimization - Lovasz, Schrijver - 1991
194	Many hard examples for resolution - Chvátal, Szemerédi - 1988
168	The complexity of finite functions - Boppana, Sipser - 1992
162	A.: Short proofs are narrow—resolution made simple - Ben-Sasson, Wigderson
152	Natural proofs - Razborov, Rudich - 1997
147	Mick gets some (the odds are on his side - Chvatal, Reed - 1992
142	and Avi Wigderson. Monotone circuits for connectivity require super-logarithmic depth - Karchmer - 1990
124	Analysis of two simple heuristics on a random instance of k-SAT - Frieze, Suen - 1996
121	Lower bounds for the monotone complexity of some boolean functions - Razborov - 1985
120	bounds for resolution and cutting plane proofs and monotone computations - Pudlák, “Lower - 1997
117	Exponential lower bounds for the pigeonhole principle - Beame, Impagliazzo, et al. - 1992
116	The monotone circuit complexity of boolean functions - Alon, Boppana - 1987
115	The synthesis of two terminal switching circuits - Shannon - 1949
109	The complexity of the pigeonhole principle - Ajtai - 1988
96	Proof Theory - Takeuti - 1987
90	Simplified and improved resolution lower bounds, in - Beame, Pitassi - 1996
90	Metamathematics of first-order arithmetic - Hájek, Pudlák - 1993
79	Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem - Chao, Franco - 1990
79	monotone formulae for the majority function - Valiant, Short - 1984
75	Approximating the unsatisfiability threshold of random formulas. Random Structures Algorithms - Kirousis, Kranakis, et al. - 1998
71	Lower Bounds for Cutting Planes Proofs with Small Coefficients - Bonet, Pitassi, et al. - 1997
69	Provability of the pigeonhole principle and the existence of infinitely many primes, JSL 53 - Paris, Wilkie, et al. - 1988
68	Wigderson: Monotone Circuits for Matching Require Linear Depth - Raz, A
67	Some consequences of cryptographic conjectures for S 1 2 and EF - Krajíček, Pudlák - 1995
64	An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle, Random Structures and Algorithms - Krajíček, Pudlák, et al. - 1995
63	Polynomial size proofs of the propositional pigeonhole principle. Journal of Symbolic Logic 52 - Buss - 1987
56	Bounded arithmetic and the polynomial hierarchy, APAL 52 - Krajíček, Pudlák, et al. - 1991
54	The gap between monotone and nonmonotone circuit complexity is exponential - Tardos - 1988
53	Introduction to Circuit Complexity - Vollmer - 1999
51	Resolution Proof of generalized Pigeonhole principles - Buss, Tur'an - 1977
51	Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic - Razborov - 1995
46	Resolution Lower Bounds for the Weak Pigeonhole Principle. Found at Electronic Col-loqium on Computational Complexity, Reports Series 2001, Available at http://www.eccc.unitrier.de/eccc - Raz - 1983
46	Lower bounds for the polynomial calculus - Razborov - 1998
45	Bounded arithmetic and lower bounds in boolean complexity - Razborov - 1993
44	GALESI: A study of proof search algorithms for Resolution and Polynomial Calculus - BONET, N - 1999
44	On the complexity of unsatisfiability proofs for random k-CNF formulas - Beame, Karp, et al. - 1998
42	A new proof of the weak pigeonhole principle - Maciel, Pitassi, et al.
40	Resolution lower bounds for perfect matching principles - Razborov
39	Upper and lower bounds on tree-like cutting planes proofs - IMPAGLIAZZO, PITASSI, et al. - 1994
34	Lower bounds for the weak pigeonhole principle and random formulas beyond resolution - Atserias, Bonet, et al. - 2002
33	On the automatizability of resolution and related propositional proof systems - Atserias, Bonet - 2004
33	Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus - Razborov, Wigderson, et al.
26	bounds for propositional proofs and independence results in bounded arithmetic - Razborov, Lower - 1996
25	Time-Space Tradeoffs for Satisfiability - Fortnow - 2000
25	Bounded Arithmetic, Propositional Logic and Complexity Theory - Krajcek - 1996