✦ LIBER ✦

More on BPP and the Polynomial-time Hierarchy

✍ Scribed by Ran Canetti

Book ID: 107766298
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 416 KB
Volume: 57
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00016-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

BPP and the polynomial hierarchy

✍ Clemens Lautemann 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 197 KB

On collapsing the polynomial-time hierar

On collapsing the polynomial-time hierarchy

✍ Ronald V. Book 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 210 KB

The Analytic Polynomial-Time Hierarchy

✍ Herbert Baier; Klaus W. Wagner 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 863 KB

Motivated by results on interactive proof systems we investigate an 3-V-hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomial-time hierarchy, is called the analytic polynomial-time hierarchy. It is shown that every

A time-space hierarchy between polynomia

A time-space hierarchy between polynomial time and polynomial space

✍ P. Clote 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 808 KB

Parity, circuits, and the polynomial-tim

Parity, circuits, and the polynomial-time hierarchy

✍ Merrick Furst; James B. Saxe; Michael Sipser 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 880 KB

A note on sparse sets and the polynomial

A note on sparse sets and the polynomial-time hierarchy

✍ Ronald V. Book; Shouwen Tang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 404 KB