Author:
Hemaspaandra Edith,Hemaspaandra Lane A.,Hempel Harald
Publisher
Springer Berlin Heidelberg
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounded Queries, Approximations, and the Boolean Hierarchy;Information and Computation;2001-09
2. A note on parallel queries and the symmetric-difference hierarchy;Information Processing Letters;1998-04
3. Query order in the polynomial hierarchy;Fundamentals of Computation Theory;1997
4. R1−tt SN (NP) distinguishes robust many-one and Turing completeness;Lecture Notes in Computer Science;1997
5. Quantum bounded query complexity;Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)