Nitin Saxena

	2012
40		Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena: Trading GRH for algebra: Algorithms for factoring polynomials and related structures. Math. Comput. 81(277): (2012)
	2011
39		Malte Beecken, Johannes Mittmann, Nitin Saxena: Algebraic Independence and Blackbox Identity Testing. ICALP (2) 2011: 137-148
38		Nitin Saxena, C. Seshadhri: Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. STOC 2011: 431-440
37		Malte Beecken, Johannes Mittmann, Nitin Saxena: Algebraic Independence and Blackbox Identity Testing CoRR abs/1102.2789: (2011)
36		Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits CoRR abs/1111.0582: (2011)
35		Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. Electronic Colloquium on Computational Complexity (ECCC) 18: 143 (2011)
34		Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Electronic Colloquium on Computational Complexity (ECCC) 18: 21 (2011)
33		Malte Beecken, Johannes Mittmann, Nitin Saxena: Algebraic Independence and Blackbox Identity Testing. Electronic Colloquium on Computational Complexity (ECCC) 18: 22 (2011)
32		Nitin Saxena, C. Seshadhri: An Almost Optimal Rank Bound for Depth-3 Identities. SIAM J. Comput. 40(1): 200-224 (2011)
	2010
31		Nitin Saxena, C. Seshadhri: From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. FOCS 2010: 21-29
30		Nitin Saxena, C. Seshadhri: From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits CoRR abs/1002.0145: (2010)
29		Nitin Saxena, C. Seshadhri: Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter CoRR abs/1011.3234: (2010)
28		Nitin Saxena, C. Seshadhri: From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits. Electronic Colloquium on Computational Complexity (ECCC) 17: 13 (2010)
27		Nitin Saxena, C. Seshadhri: Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. Electronic Colloquium on Computational Complexity (ECCC) 17: 167 (2010)
26		Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Deterministic Polynomial Time Algorithms for Matrix Completion Problems. SIAM J. Comput. 39(8): 3736-3751 (2010)
	2009
25		Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: The Power of Depth 2 Circuits over Algebras. FSTTCS 2009: 371-382
24		Nitin Saxena, C. Seshadhri: An Almost Optimal Rank Bound for Depth-3 Identities. IEEE Conference on Computational Complexity 2009: 137-148
23		Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for deterministic polynomial factoring. ISSAC 2009: 191-198
22		Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: The Power of Depth 2 Circuits over Algebras CoRR abs/0904.2058: (2009)
21		Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Deterministic Polynomial Time Algorithms for Matrix Completion Problems CoRR abs/0907.0774: (2009)
20		Nitin Saxena: Progress on Polynomial Identity Testing. Electronic Colloquium on Computational Complexity (ECCC) 16: 101 (2009)
19		Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: The Power of Depth 2 Circuits over Algebras. Electronic Colloquium on Computational Complexity (ECCC) 16: 36 (2009)
18		Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Deterministic Polynomial Time Algorithms for Matrix Completion Problems. Electronic Colloquium on Computational Complexity (ECCC) 16: 58 (2009)
	2008
17		Nitin Saxena: Diagonal Circuit Identity Testing and Lower Bounds. ICALP (1) 2008: 60-71
16		Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for Deterministic Polynomial Factoring CoRR abs/0804.1974: (2008)
15		Nitin Saxena, C. Seshadhri: An Almost Optimal Rank Bound for Depth-3 Identities CoRR abs/0811.3161: (2008)
14		Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena: Trading GRH for algebra: algorithms for factoring polynomials and related structures CoRR abs/0811.3165: (2008)
13		Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for Deterministic Polynomial Factoring. Electronic Colloquium on Computational Complexity (ECCC) 15(043): (2008)
12		Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena: Trading GRH for algebra: algorithms for factoring polynomials and related structures. Electronic Colloquium on Computational Complexity (ECCC) 15(099): (2008)
11		Nitin Saxena, C. Seshadhri: An Almost Optimal Rank Bound for Depth-3 Identities. Electronic Colloquium on Computational Complexity (ECCC) 15(108): (2008)
	2007
10		Nitin Saxena: Diagonal Circuit Identity Testing and Lower Bounds. Algebraic Methods in Computational Complexity 2007
9		Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity 16(2): 115-138 (2007)
8		Nitin Saxena: Diagonal Circuit Identity Testing and Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC) 14(124): (2007)
	2006
7		Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits. IEEE Conference on Computational Complexity 2006: 9-17
6		Manindra Agrawal, Nitin Saxena: Equivalence of F-Algebras and Cubic Forms. STACS 2006: 115-126
5		Neeraj Kayal, Nitin Saxena: Complexity of Ring Morphism Problems. Computational Complexity 15(4): 342-390 (2006)
	2005
4		Neeraj Kayal, Nitin Saxena: On the Ring Isomorphism and Automorphism Problems. IEEE Conference on Computational Complexity 2005: 2-12
3		Manindra Agrawal, Nitin Saxena: Automorphisms of Finite Rings and Applications to Complexity of Problems. STACS 2005: 1-17
2		Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits Electronic Colloquium on Computational Complexity (ECCC)(150): (2005)
	2004
1		Neeraj Kayal, Nitin Saxena: On the Ring Isomorphism & Automorphism Problems Electronic Colloquium on Computational Complexity (ECCC)(109): (2004)

Coauthor Index

1	Manindra Agrawal	[3] [6] [35] [36]
2	Malte Beecken	[33] [37] [39]
3	Seshadhri Comandur (C. Seshadhri)	[11] [15] [24] [27] [28] [29] [30] [31] [32] [38]
4	Gábor Ivanyos	[12] [13] [14] [16] [18] [21] [23] [26] [40]
5	Marek Karpinski	[12] [13] [14] [16] [18] [21] [23] [26] [40]
6	Neeraj Kayal	[1] [2] [4] [5] [7] [9]
7	Johannes Mittmann	[33] [37] [39]
8	Lajos Rónyai	[12] [14] [40]
9	Chandan Saha	[19] [22] [25] [34] [35] [36]
10	Ramprasad Saptharishi	[19] [22] [25] [34] [35] [36]

Colors in the list of coauthors

Last update Sat Feb 11 22:55:45 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page