Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference32 articles.
1. On pseudorandomness and Resource–Bounded measure;Arvind,1997
2. V. Arvind, J. Köbler, Graph isomorphism is low for ZPPNP and other lowness results, in: Proceedings of Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2000, pp. 431–442
3. New lowness results for ZPPNP and other complexity classes;Arvind;J. Comput. System Sci.,2002
4. Trading group theory for randomness;Bábai,1985
5. Arthur–Merlin games: A randomized proof system, and a hierarchy of complexity classes;Bábai;J. Comput. System Sci.,1988
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献