✦ LIBER ✦

IP = PSPACE

✍ Scribed by Shamir, Adi

Book ID: 115468203
Publisher: Association for Computing Machinery
Year: 1992
Tongue: English
Weight: 548 KB
Volume: 39
Category: Article
ISSN: 0004-5411
DOI: 10.1145/146585.146609

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The relativized relationship between pro

The relativized relationship between probabilistically checkable debate systems, IP and PSPACE

✍ Alexander Russell; Ravi Sundaram 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Phutball is PSPACE-hard

✍ Dariusz Dereniowski 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 386 KB

Gobang ist PSPACE-vollständig

✍ Stefan Reisch 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 376 KB

Characterizing PSPACE with pointers

✍ Isabel Oitavem 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract This paper gives an implicit characterization of the class of functions computable in polynomial space by deterministic Turing machines – PSPACE. It gives an inductive characterization of PSPACE with no ad‐hoc initial functions and with only one recursion scheme. The main novelty of thi

Examples of ℒpspaces (1

✍ G. Schechtman 📂 Article 📅 1975 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 370 KB

On embedding expanders into ℓpspaces

✍ Jiří Matoušek 📂 Article 📅 1997 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 346 KB