Author:
Buhrman Harry,Chang Richard,Fortnow Lance
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. A. Amir, R. Beigel, and W. I. Gasarch. Some connections between bounded query classes and non-uniform complexity. In Proceedings of the 5th Structure in Complexity Theory Conference, pages 232–243, 1990.
2. R. Beigel. Bounded queries to SAT and the Boolean hierarchy. Theoretical Computer Science, 84(2):199–223, July 1991.
3. R. Beigel, R. Chang, and M. Ogiwara. A relationship between difference hierarchies and relativized polynomial hierarchies. Mathematical Systems Theory, 26(3):293–310, July 1993.
4. H. Buhrman and L. Fortnow. Two queries. Journal of Computer and System Sciences, 59(2):182–194, 1999.
5. J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The Boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6):1232–1252, December 1988.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献