Space complexity in propositional calculus

Authors:
Michael Alekhnovich;Eli Ben-Sasson;Alexander A.;Avi Wigderson
Affiliations:
Moscow State University, Moscow, Russia;Institute of Computer Science, Hebrew University, Jerusalem, Israel;Razborov Steklov Mathematical Institute, Moscow, Russia;Institute for Advancec Study Princeton, and Institute of Computer Science, Hebrew University, Jerusalem, Israel
Venue:
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Year:
2000

Short proofs for tricky formulas

Acta Informatica
Bounded arithmetic, propositional logic, and complexity theory

Bounded arithmetic, propositional logic, and complexity theory
Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Space bounds for resolution

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Space bounds for resolution

Information and Computation
Size space tradeoffs for resolution

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the Complexity of Resolution with Bounded Conjunctions

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Space complexity of random formulae in resolution

Random Structures & Algorithms
The Depth of Resolution Proofs

Studia Logica

Hi-index	0.00