Author:
Gurjar Rohit,Korwar Arpita,Saxena Nitin,Thierauf Thomas
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference36 articles.
1. Leonard M. Adleman & Hendrik W. Lenstra (1986). Finding Irreducible Polynomials over Finite Fields. In Proceedings of the 18th ACM Symposium on Theory of Computing (STOC), 350–355. ACM, New York, NY, USA. ISBN 0-89791-193-8.
2. Manindra Agrawal (2005). Proving Lower Bounds Via Pseudo random Generators. In Proceedings of Foundations of 25th Software Technology and Theoretical Computer Science (FSTTCS), volume 3821 of Lecture Notes in Computer Science, 92–105.
3. Manindra Agrawal, Rohit Gurjar, Arpita Korwar & Nitin Saxena (2015). Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM Journal on Computing 44(3), 669–697. URL http://dx.doi.org/10.1137/140975103 .
4. Manindra Agrawal, Chandan Saha & Nitin Saxena (2013). Quasi-polynomial hitting-set for set-depth-D formulas. In Proceedings of the 45th ACM Symposium on Theory of Computing (STOC), 321–330.
5. Jan Behrens & Stephan Waack (1998). Equivalence Test and Or dering Transformation for Parity-OBDDs of Different Variable Order ing. In 15th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1373, 227–237. Springer-Verlag.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献