Author:
Amir Amihood,Beigel Richard,Gasarch William
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference72 articles.
1. Quasi-linear truth-table reductions to p-selective sets;Agrawal;Theoret. Comput. Sci.,1996
2. M. Ajtai, M. Ben-Or, A theorem on probabilistic constant depth circuits, in: Proceedings of the 16th ACM Symposium on Theory of Computing, 1984, pp. 471–474
3. A. Amir, R. Beigel, W. Gasarch, Some connections between bounded query classes and non-uniform complexity, Technical report TR 00-0024, 2000. Available from
4. Polynomial terse sets;Amir;Inf. Comput.,1988
5. The polynomial-time hierarchy and sparse oracles;Balcázar;J. ACM,1986
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献