Bounding queries in the analytic polynomial-time hierarchy
From MaRDI portal
Publication:1274987
DOI10.1016/S0304-3975(98)00057-7zbMath0916.68058MaRDI QIDQ1274987
Herbert Baier, Klaus W. Wagner
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Addendum to: Non-deterministic exponential time has two-prower interactive protocols
- The polynomial-time hierarchy
- Complete sets and the polynomial-time hierarchy
- PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS
- The Analytic Polynomial-Time Hierarchy
This page was built for publication: Bounding queries in the analytic polynomial-time hierarchy