✦ LIBER ✦

Space Complexity in Propositional Calculus

✍ Scribed by Alekhnovich, Michael; Ben-Sasson, Eli; Razborov, Alexander A.; Wigderson, Avi

Book ID: 118180375
Publisher: Society for Industrial and Applied Mathematics
Year: 2002
Tongue: English
Weight: 311 KB
Volume: 31
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539700366735

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of subclasses of the intuitio

Complexity of subclasses of the intuitionistic propositional calculus

✍ G. Mints 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 341 KB

Tractability through symmetries in propo

Tractability through symmetries in propositional calculus

✍ Belaid Benhamou; Lakhdar Sais 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 861 KB

Ideographic Computation in the Propositi

Ideographic Computation in the Propositional Calculus

✍ Gerald B. Standley 📂 Article 📅 1954 🏛 Association for Symbolic Logic 🌐 English ⚖ 284 KB

Calculus on complex Banach spaces

✍ J. Pian; C. S. Sharma 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 679 KB

Pseudorandom Generators in Propositional

Pseudorandom Generators in Propositional Proof Complexity

✍ Alekhnovich, Michael; Ben-Sasson, Eli; Razborov, Alexander A.; Wigderson, Avi 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 283 KB

A Couple of Novelties in the Proposition

A Couple of Novelties in the Propositional Calculus

✍ C. A. R. Hóre 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views