Referenzen
42.
Manindra Agrawal, Neeraj Kayal und Nitin Saxena
Errata: PRIMES is in P [ MR2123939]
Ann. of Math. (2), 189(1):317--318
2019
41.
Anurag Pandey, Nitin Saxena und Amit Sinhababu
Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
Comput. Complexity, 27(4):617--670
2018
40.
Zeyu Guo, Nitin Saxena und Amit Sinhababu
Algebraic dependencies and PSPACE algorithms in approximative complexity
33rd Computational Complexity Conference Band 102 aus LIPIcs. Leibniz Int. Proc. Inform.
Seite Art. No. 10, 21.
Herausgeber: Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern,
2018
39.
Manindra Agrawal, Sumanta Ghosh und Nitin Saxena
Bootstrapping variables in algebraic circuits
STOC'18---Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
Seite 1166--1179.
Herausgeber: ACM, New York,
2018
38.
Pranjal Dutta, Nitin Saxena und Amit Sinhababu
Discovering the roots: uniform closure results for algebraic classes under factoring
STOC'18---Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
Seite 1152--1165.
Herausgeber: ACM, New York,
2018
37.
Michael A. Forbes, Sumanta Ghosh und Nitin Saxena
Towards blackbox identity testing of log-variate circuits
45th International Colloquium on Automata, Languages, and Programming Band 107 aus LIPIcs. Leibniz Int. Proc. Inform.
Seite Art. No. 54, 16.
Herausgeber: Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern,
2018
36.
Rohit Gurjar, Arpita Korwar, Nitin Saxena und Thomas Thierauf
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
Comput. Complexity, 26(4):835--880
2017
35.
Rohit Gurjar, Arpita Korwar und Nitin Saxena
Identity testing for constant-width, and any-order, read-once oblivious arithmetic branching programs
Theory Comput., 13:Paper No. 2, 21
2017
34.
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena und Igor E. Shparlinski
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields
Algorithmica,
2017
33.
Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal und Nitin Saxena
Irreducibility and deterministic r-th root finding over finite fields
ISSAC'17---Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation
Seite 37--44.
Herausgeber: ACM, New York,
2017
32.
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi und Nitin Saxena
Jacobian hits circuits: hitting sets, lower bounds for depth-D occur-k formulas and depth-3 transcendence degree-k circuits
SIAM J. Comput., 45(4):1533--1562
2016
31.
Anurag Pandey, Nitin Saxena und Amit Sinhababu
Algebraic independence over positive characteristic: new criterion and applications to locally low algebraic rank circuits
41st International Symposium on Mathematical Foundations of Computer Science Band 58 aus LIPIcs. Leibniz Int. Proc. Inform.
Seite Art. No. 74, 15.
Herausgeber: Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern,
2016
Seite:  
Previous | 0, 1, 2 | Next
Export als:
BibTeX, XML