✦ LIBER ✦

Refining the polynomial hierarchy

✍ Scribed by V. L. Selivanov

Book ID: 110611842
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 706 KB
Volume: 38
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf02671730

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

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

Real addition and the polynomial hierarc

Real addition and the polynomial hierarchy

✍ Eduardo D. Sontag 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 506 KB

On collapsing the polynomial-time hierar

On collapsing the polynomial-time hierarchy

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

Bounded arithmetic and the polynomial hi

Bounded arithmetic and the polynomial hierarchy

✍ Jan Krajíček; Pavel Pudlák; Gaisi Takeuti 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 706 KB

Perceptrons, PP, and the polynomial hier

Perceptrons, PP, and the polynomial hierarchy

✍ Richard Beigel 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 570 KB