Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference23 articles.
1. A. Amir, R. Beigel, and W. I. Gasarch. Some connections between bounded query classes and non-uniform complexity.Proceedings of the 5th Structure in Complexity Theory Conference, pages 232?243, 1990.
2. A. Amir and W. I. Gasarch. Polynomial terse sets.Information and Computation,77:37?56, April 1988.
3. A. Bertoni, D. Bruschi, D. Joseph, M. Sitharam, and P. Young. Generalized Boolean hierarchies and the hierarchy over RP. Technical Report 809, Department of Computer Sciences, University of Wisconsin-Madison, 1989.
4. R. Beigel. NP-hard sets are p-supertese unless R = NP. Technical Report 4, Department of Computer Science, The Johns Hopkins University, 1988.
5. R. Beigel. Bounded queries to SAT and the Boolean hierarchy.Theoretical Computer Science,84(2):199?223, July 1991.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献