Author:
Hemaspaandra Lane A.,Kosub Sven,Wagner Klaus W.
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. D. P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. International Series in Computer Science. Prentice Hall, New York, 1994.
2. A. E. F. Clementi, J. D. P. Rolim, and L. Trevisan. Recent advances towards proving P=BPP. Bulletin of the EATCS, 64:96–103, 1998.
3. S. A. Cook. The complexity of theorem-proving procedures. In Proceedings 3rd ACM Symposium on Theory of Computing, pages 151–158, 1971.
4. S. Fenner, L. Fortnow, and S. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48:116–148, 1994.
5. J. Gill. Computational complexity of probabilistic complexity classes. SIAM Journal on Computing, 6:675–695, 1977.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献