Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Nitin
Last name:	Saxena
DBLP:	86/6915
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 22 of 22  

Select a publication
Show	Title	Venue	Rating	Date
	Nitin Saxena, C. Seshadhri. An Almost Optimal Rank Bound for Depth-3 Identities.	Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009 2009	(0)	2009
	Gábor Ivanyos, Marek Karpinski, Nitin Saxena. Schemes for deterministic polynomial factoring.	Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings 2009	(0)	2009
	Chandan Saha, Ramprasad Saptharishi, Nitin Saxena. The Power of Depth 2 Circuits over Algebras	CoRR 2009, Volume 0	(0)	2009
	Gábor Ivanyos, Marek Karpinski, Nitin Saxena. Deterministic Polynomial Time Algorithms for Matrix Completion Problems	CoRR 2009, Volume 0	(0)	2009
	Chandan Saha, Ramprasad Saptharishi, Nitin Saxena. The Power of Depth 2 Circuits over Algebras.	IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India 2009	(0)	2009
	Nitin Saxena. Diagonal Circuit Identity Testing and Lower Bounds.	Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games 2008	(0)	2008
	Gábor Ivanyos, Marek Karpinski, Nitin Saxena. Schemes for Deterministic Polynomial Factoring	CoRR 2008, Volume 0	(0)	2008
	Nitin Saxena, C. Seshadhri. An Almost Optimal Rank Bound for Depth-3 Identities	CoRR 2008, Volume 0	(0)	2008
	Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena. Trading GRH for algebra: algorithms for factoring polynomials and related structures	CoRR 2008, Volume 0	(0)	2008
	Gábor Ivanyos, Marek Karpinski, Nitin Saxena. Schemes for Deterministic Polynomial Factoring.	Electronic Colloquium on Computational Complexity (ECCC) 2008, Volume 15	(0)	2008
	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) 2008, Volume 15	(0)	2008
	Nitin Saxena, C. Seshadhri. An Almost Optimal Rank Bound for Depth-3 Identities.	Electronic Colloquium on Computational Complexity (ECCC) 2008, Volume 15	(0)	2008
	Nitin Saxena. Diagonal Circuit Identity Testing and Lower Bounds.	Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007 2008	(0)	2007
	Neeraj Kayal, Nitin Saxena. Polynomial Identity Testing for Depth 3 Circuits.	Computational Complexity 2007, Volume 16	(0)	2007
	Nitin Saxena. Diagonal Circuit Identity Testing and Lower Bounds.	Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14	(0)	2007
	Neeraj Kayal, Nitin Saxena. Polynomial Identity Testing for Depth 3 Circuits.	21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic 2006	(0)	2006
	Manindra Agrawal, Nitin Saxena. Equivalence of F-Algebras and Cubic Forms.	STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings 2006	(0)	2006
	Neeraj Kayal, Nitin Saxena. Complexity of Ring Morphism Problems.	Computational Complexity 2006, Volume 15	(0)	2006
	Neeraj Kayal, Nitin Saxena. On the Ring Isomorphism and Automorphism Problems.	20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA 2005	(0)	2005
	Manindra Agrawal, Nitin Saxena. Automorphisms of Finite Rings and Applications to Complexity of Problems.	STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings 2005	(0)	2005
	Neeraj Kayal, Nitin Saxena. Polynomial Identity Testing for Depth 3 Circuits	Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null	(0)	2005
	Neeraj Kayal, Nitin Saxena. On the Ring Isomorphism Automorphism Problems	Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null	(0)	2004

Your query returned 22 matches in the database.