Referenzen
21.
Manindra Agrawal, Chandan Saha und Nitin Saxena
Quasi-polynomial hitting-set for set-depth-Î? formulas
STOC'13---Proceedings of the 2013 ACM Symposium on Theory of Computing , Seite 321--330.
Herausgeber: ACM, New York,
2013
20.
Nitin Saxena und C. Seshadhri
Blackbox identity testing for bounded top-fanin depth-3 circuits: the field doesn't matter
SIAM J. Comput., 41(5):1285--1298
2012
19.
Manuel Arora, Gábor Ivanyos, Marek Karpinski und Nitin Saxena
Deterministic Polynomial Factoring and Association Schemes
CoRR, abs/1205.5653
2012
18.
A. Roy, J. Shin und N. Saxena
Entropy-based location management in long-term evolution cellular systems
IET Commun., 6(2):138--146
2012
17.
Gábor Ivanyos, Marek Karpinski, Lajos Rónyai und Nitin Saxena
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Math. Comp., 81(277):493--531
2012
16.
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi und Nitin Saxena
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
STOC'12---Proceedings of the 2012 ACM Symposium on Theory of Computing , Seite 599--613.
Herausgeber: ACM, New York,
2012
15.
Nitin Saxena und C. Seshadhri
An almost optimal rank bound for depth-3 identities
SIAM J. Comput., 40(1):200--224
2011
14.
Malte Beecken, Johannes Mittmann und Nitin Saxena
Algebraic independence and blackbox identity testing
Automata, languages and programming. Part II Band 6756 aus Lecture Notes in Comput. Sci.
Seite 137--148.
Herausgeber: Springer, Heidelberg,
2011
13.
Nitin Saxena und C. Seshadhri
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter
STOC'11---Proceedings of the 43rd ACM Symposium on Theory of Computing , Seite 431--439.
Herausgeber: ACM, New York,
2011
12.
Gábor Ivanyos, Marek Karpinski und Nitin Saxena
Deterministic polynomial time algorithms for matrix completion problems
SIAM J. Comput., 39(8):3736--3751
2010
11.
Nitin Saxena und C. Seshadhri
From Sylvester-Gallai configurations to rank bounds: improved black-box identity test for depth-3 circuits
2010 IEEE 51st Annual Symposium on Foundations of Computer Science---FOCS 2010
Seite 21--29.
Herausgeber: IEEE Computer Soc., Los Alamitos, CA,
2010
10.
Nitin Saxena
Progress on polynomial identity testing
Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, (99):49--79
2009
Seite:  
Export als:
BibTeX, XML