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
β¦ LIBER β¦
A time-space hierarchy between polynomial time and polynomial space
β Scribed by P. Clote
- Publisher
- Springer
- Year
- 1992
- Tongue
- English
- Weight
- 808 KB
- Volume
- 25
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The Analytic Polynomial-Time Hierarchy
β
Herbert Baier; Klaus W. Wagner
π
Article
π
1998
π
John Wiley and Sons
π
English
β 863 KB
Parity, circuits, and the polynomial-tim
β
Merrick Furst; James B. Saxe; Michael Sipser
π
Article
π
1984
π
Springer
π
English
β 880 KB
A positive relativization of polynomial
β
Ricard GavaldΓ
π
Article
π
1993
π
Elsevier Science
π
English
β 447 KB
Relating the bounded arithmetic and poly
β
Samuel R. Buss
π
Article
π
1995
π
Elsevier Science
π
English
β 711 KB
The polynomial and linear time hierarchi
β
Leszek A. KoΕodziejczyk; Neil Thapen
π
Article
π
2009
π
John Wiley and Sons
π
English
β 203 KB
## Abstract We show that the bounded arithmetic theory V^0^ does not prove that the polynomial time hierarchy collapses to the linear time hierarchy (without parameters). The result follows from a lower bound for bounded depth circuits computing prefix parity, where the circuits are allowed some au
A relationship between difference hierar
β
Richard Beigel; Richard Chang; Mitsunori Ogiwara
π
Article
π
1993
π
Springer
π
English
β 900 KB