Author:
Köbler Johannes,Schöning Uwe,Torán Jacobo
Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. L. Babai, Moderately exponential bound for graph isomorphism. In Proceedings Fundamentals of Computation Theory, Lecture Notes in Computer Science 117 (1981), 34–50.
2. L. Babai, S. Moran, Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes. In Journal of Computer and System Sciences 36 (1988), 254–276.
3. J.L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity I. Springer, 1987.
4. R. Beigel, J. Gill, U. Hertrampf, Counting classes: Thresholds, parity, mods, and fewness. In Proceedings 7th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 415 (1990), 49–57.
5. R. Beigel, L. Hemachandra, G. Wechsung, On the power of probabilistic polynomial time: PNP[log] ⊂-PP. In Proceedings 4th Structure in Complexity Theory Conference, p. 225–227, IEEE Computer Society, 1989.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reductions to Graph Isomorphism;FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science;2007