Referenzen
33.
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
32.
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
31.
Rohit Gurjar, Arpita Korwar und Nitin Saxena
Identity testing for constant-width, and commutative, read-once oblivious ABPs
31st Conference on Computational Complexity Band 50 aus LIPIcs. Leibniz Int. Proc. Inform.
Seite Art. No. 29, 16.
Herausgeber: Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern,
2016
30.
Manindra Agrawal, Nitin Saxena und Shubham Sahai Srivastava
Integer factoring using small algebraic dependencies
41st International Symposium on Mathematical Foundations of Computer Science Band 58 aus LIPIcs. Leibniz Int. Proc. Inform.
Seite Art. No. 6, 14.
Herausgeber: Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern,
2016
29.
Manindra Agrawal, Rohit Gurjar, Arpita Korwar und Nitin Saxena
Hitting-sets for ROABP and sum of set-multilinear circuits
SIAM J. Comput., 44(3):669--697
2015
28.
Rohit Gurjar, Arpita Korwar, Nitin Saxena und Thomas Thierauf
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
30th Conference on Computational Complexity Band 33 aus LIPIcs. Leibniz Int. Proc. Inform.
Seite 323--346.
Herausgeber: Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern,
2015
27.
Johannes Mittmann, Nitin Saxena und Peter Scheiblechner
Algebraic independence in positive characteristic: a p-adic calculus
Trans. Amer. Math. Soc., 366(7):3425--3450
2014
26.
Manuel Arora, Gábor Ivanyos, Marek Karpinski und Nitin Saxena
Deterministic polynomial factoring and association schemes
LMS J. Comput. Math., 17(1):123--140
2014
25.
Nitin Saxena
Progress on polynomial identity testing-II
Perspectives in computational complexity Band 26 aus Progr. Comput. Sci. Appl. Logic
Seite 131--146.
Herausgeber: Birkhäuser/Springer, Cham,
2014
24.
Chandan Saha, Ramprasad Saptharishi und Nitin Saxena
A case of depth-3 identity testing, sparse factorization and duality
Comput. Complexity, 22(1):39--69
2013
23.
M. Beecken, J. Mittmann und N. Saxena
Algebraic independence and blackbox identity testing
Inform. and Comput., 222:2--19
2013
22.
Nitin Saxena und C. Seshadhri
From Sylvester-Gallai configurations to rank bounds: improved blackbox identity test for depth-3 circuits
J. ACM, 60(5):Art. 33, 33
2013
Seite:  
Export als:
BibTeX, XML