Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. A. Amir, R. Beigel, and W. Gasarch. Some connections between bounded query classes and non-uniform complexity. In Proc. 5th Structure in Complexity Theory, pages 232–242, 1990.
2. A. Amir and W. Gasarch. Polynomial terse sets. Information and Computation, 77:27–56, 1988.
3. R. Beigel. Bi-immunity results for cheatable sets. TCS, 73(3):249–263, 1990.
4. R. Beigel. Bounded queries to SAT and the boolean hierarchy. Theoretical Computer Science, 84(2):199–223, 1991.
5. R. Beigel, W. Gasarch, and E. Kinber. Frequency computation and bounded queries. In Proc. 10th Structure in Complexity Theory, pages 125–132, 1995.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献