Abstract—During the last decade, an active line of research in proof complexity has been to study space complexity and time- space trade-offs for proofs.

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.

Abstract: During the last decade, an active line of research in proof complexity has been to study space complexity and time space trade-offs for proofs.

Abstract. During the last 10 to 15 years, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for ...

Abstract—During the last decade, an active line of research in proof complexity has been to study space complexity and time- space trade-offs for proofs.

Oct 20, 2012 · During the last decade, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for ...

Abstract—During the last decade, an active line of research in proof complexity has been to study space complexity and time- space trade-offs for proofs.

Oct 20, 2012 · During the last decade, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for ...

During the last 10 to 15 years, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for proofs.

Oct 1, 2015 · In this work we focus on total space (for RES), which is the maximum number of variables (possibly repeated) to be kept simultaneously in memory ...