TY - JOUR
T1 - Space complexity in propositional calculus
AU - Alekhnovich, Michael
AU - Ben-Sasson, Eli
AU - Razborov, Alexander A.
AU - Wigderson, Avi
PY - 2002/3
Y1 - 2002/3
N2 - We study space complexity in the framework of propositional proofs. We consider a natural model analogous to Turing machines with a read-only input tape and such popular propositional proof systems as resolution, polynomial calculus, and Frege systems. We propose two different space measures, corresponding to the maximal number of bits, and clauses/monomials that need to be kept in the memory simultaneously. We prove a number of lower and upper bounds in these models, as well as some structural results concerning the clause space for resolution and Frege systems.
AB - We study space complexity in the framework of propositional proofs. We consider a natural model analogous to Turing machines with a read-only input tape and such popular propositional proof systems as resolution, polynomial calculus, and Frege systems. We propose two different space measures, corresponding to the maximal number of bits, and clauses/monomials that need to be kept in the memory simultaneously. We prove a number of lower and upper bounds in these models, as well as some structural results concerning the clause space for resolution and Frege systems.
KW - Frege
KW - Polynomial calculus
KW - Proof complexity
KW - Resolution
UR - http://www.scopus.com/inward/record.url?scp=0036520257&partnerID=8YFLogxK
U2 - 10.1137/S0097539700366735
DO - 10.1137/S0097539700366735
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0036520257
SN - 0097-5397
VL - 31
SP - 1184
EP - 1211
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 4
ER -