Publisher
Springer Berlin Heidelberg
Reference13 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, 1990.
2. A. Amir and W. Gasarch. Polynomial terse sets. Information and Computation, 77, 1988.
3. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. 1988.
4. R. Beigel, W. Gasarch, and E. Kinber. Frequency computation and bounded queries. In Proc. 10th Structure in Complexity Theory, 1995.
5. R. Beigel, M. Kummer, and F. Stephan. Quantifying the amount of verboseness. In Proc. Logical Found. of Comp. Sc. LNCS 620, 1992.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献