Subject
Computer Science Applications,General Mathematics,Software
Reference21 articles.
1. 1. ALLENDER E., HEMACHANDRA L. A., OGIWARA M., and WATANABE O., Relating equivalence and reducibility to sparse sets, SIAM Journal on Computing, 1992, 2, pp. 521-539.11633440761.68039
2. 2. AMIR A., BEIGEL R. and GASARCH W. I., Some connections between bounded query classes and non-uniform complexity, Proceedings of the 5th Structure in Complexity Theory Conference, 1990, pp. 232-243.1058.680561097673
3. 3. BEIGEL R., Query-limited Reducibilities, PhD thesis, Stanford University, 1987.2636225
4. 4. BEIGEL R., Bounded queries to SAT and the boolean hierarchy, Theoretical Computer Science, 1991, 84 (2), pp. 199-223.11181210739.68035
5. 5. BEIGEL R., CHANG R., and OGIWARA M., A relationship between difference hierarchies and relativized polynomial hierarchies, Mathematical Systems Theory, 1993, 26 (3), pp. 293-310.12099990776.68043