Author:
Oliveira Rafael,Shpilka Amir,Volk Ben lee
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference44 articles.
1. M. Agrawal (2005). Proving Lower Bounds Via Pseudo-random Generators. In Proceedings of the 25th FSTTCS, volume 3821 of LNCS, 92–105.
2. M. Agrawal, R. Gurjar, A. Korwar & N. Saxena (2015). Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM J. Comput. 44(3), 669–697. URL http://dx.doi.org/10.1137/140975103 .
3. Agrawal M., Kayal N., Saxena N. (2004) PRIMES is in P. Annals of Mathematics 160(2): 781–793
4. M. Agrawal, C. Saha, R. Saptharishi & N. Saxena (2012). Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. In STOC, 599–614.
5. M. Agrawal, C. Saha & N. Saxena (2013). Quasi-polynomial hitting-set for set-depth- $${\Delta}$$ Δ formulas. In Symposium on Theory of Computing Conference, STOC’13, Palo Alto, CA, USA, June 1–4, 2013, 321–330.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献