Author:
Cai Jin-Yi,Charles Denis,Pavan A.,Sengupta Samik
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Lect Notes Comput Sci;V. Arvind,1997
2. V. Arvind and J. Köbler, Graph isomorphism is low for ZPP NP and other lowness results, STACS 2000.
3. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, 14–23, 1992.
4. S. Arora and S. Safra, Approximating clique is NP-complete., Proceedings of the 33rd IEEE Symposium on Foundations on Computer Science, 2–13, 1992.
5. M. Agrawal and T. Thierauf, The Boolean isomorphism problem, Proc. 37th Annual Symposium on Foundations of Computer Science, 422–430.