Author:
Burtschick H. J.,Lindner W.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference16 articles.
1. M. Agrawal and V. Arvind. Polynomial time truth-table reductions to p-selective sets.Proc. 9th Structure in Complexity Theory, pp. 24–30, 1994.
2. J. L. Balcázar, J. Diaz, and J. Gabarró.Structural Complexity I. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1988.
3. J. L. Balcázar and U. Schöning. Logarithmic advice classes.Theoret. Comput. Sci., 99:279–290, 1992.
4. R. Beigel, M. Kummer, and F. Stefan. Approximable sets.Proc. 9th Structure in Complexity Theory, pp. 12–23, 1994.
5. D. Denny-Brown, Y. Han, L. A. Hemaspaandra, and L. Torenvliet. Semi-membership algorithms: Some recent results.SIGACT News, 25(3):12–23, 1994.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献