Author:
Crasmaru Marcel,Glaßer Christian,Regan Kenneth W.,Sengupta Samik
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Lecture Notes in Computer Science;S. Aida,2002
2. Arvind, V., Kurur, P.: Graph isomorphism is in SPP. In: Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 743–750 (2002) Also ECCC TR02-037
3. Beigel, R.: The polynomial method in circuit complexity. In: Proc. 8th Annual IEEE Conference on Structure in Complexity Theory, pp. 82–95 (1993) Revised version, 1995
4. Cai, J.-Y., Hemachandra, L., Vyskoc, J.: Promise problems and guarded access to unambiguous computation. In: Ambos-Spies, K., Homer, S., Schöning, U. (eds.) Complexity Theory: Current Research, Cambridge University Press, Springer (1993)
5. Fenner, S., Fortnow, L., Kurtz, S.: Gap-definable counting classes. J. Comp. Sys. Sci. 48, 116–148 (1994)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献