Author:
Arvind V.,Mukhopadhyay Partha
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference21 articles.
1. Primality and identity testing via Chinese remaindering;Agrawal;J. ACM,2003
2. Primes is in P;Agrawal;Ann. Math.,2004
3. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in: Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992, pp. 14–23.
4. S. Arora, S. Safra, Probabilistic checking of proofs: A new characterization of NP, in: Proceedings of the 33rd Annual IEEE FOCS, 1992, pp. 2–13.
5. The monomial ideal membership problem and polynomial identity testing;Arvind,2007
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献