Space complexity in propositional calculus

DOI10.1145/335305.335347zbMath1296.03032OpenAlexW2097746739MaRDI QIDQ3192004

Eli Ben-Sasson, Avi Wigderson, Michael Alekhnovich, Alexander A. Razborov

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335347

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Related Items (3)

Linear gaps between degrees for the polynomial calculus modulo distinct primes ⋮ Space complexity of random formulae in resolution ⋮ Space bounds for resolution

This page was built for publication: Space complexity in propositional calculus