Space complexity in propositional calculus
From MaRDI portal
Publication:3192004
DOI10.1145/335305.335347zbMath1296.03032MaRDI 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
03F20: Complexity of proofs
Related Items
Space complexity of random formulae in resolution, Linear gaps between degrees for the polynomial calculus modulo distinct primes, Space bounds for resolution