Search the dblp DataBase

Publications of Author

1. Neeraj Kayal, Nitin Saxena
   On the Ring Isomorphism and Automorphism Problems. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2005, pp:2-12 [Conf]
   
2. Neeraj Kayal, Nitin Saxena
   Polynomial Identity Testing for Depth 3 Circuits. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:9-17 [Conf]
   
3. Manindra Agrawal, Nitin Saxena
   Automorphisms of Finite Rings and Applications to Complexity of Problems. [Citation Graph (0, 0)][DBLP]
   STACS, 2005, pp:1-17 [Conf]
   
4. Manindra Agrawal, Nitin Saxena
   Equivalence of F-Algebras and Cubic Forms. [Citation Graph (0, 0)][DBLP]
   STACS, 2006, pp:115-126 [Conf]
   
5. Neeraj Kayal, Nitin Saxena
   On the Ring Isomorphism & Automorphism Problems [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:109, pp:- [Journal]
   
6. Neeraj Kayal, Nitin Saxena
   Polynomial Identity Testing for Depth 3 Circuits [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:150, pp:- [Journal]
   
7. Neeraj Kayal, Nitin Saxena
   Complexity of Ring Morphism Problems. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2006, v:15, n:4, pp:342-390 [Journal]
   
8. Neeraj Kayal, Nitin Saxena
   Polynomial Identity Testing for Depth 3 Circuits. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2007, v:16, n:2, pp:115-138 [Journal]
   
9. 
   An Almost Optimal Rank Bound for Depth-3 Identities. [Citation Graph (, )][DBLP]
   
   
10. 
    Diagonal Circuit Identity Testing and Lower Bounds. [Citation Graph (, )][DBLP]
    
    
11. 
    The Power of Depth 2 Circuits over Algebras. [Citation Graph (, )][DBLP]
    
    
12. 
    Diagonal Circuit Identity Testing and Lower Bounds. [Citation Graph (, )][DBLP]
    
    
13. 
    Schemes for deterministic polynomial factoring. [Citation Graph (, )][DBLP]
    
    
14. 
    Schemes for Deterministic Polynomial Factoring [Citation Graph (, )][DBLP]
    
    
15. 
    An Almost Optimal Rank Bound for Depth-3 Identities [Citation Graph (, )][DBLP]
    
    
16. 
    Trading GRH for algebra: algorithms for factoring polynomials and related structures [Citation Graph (, )][DBLP]
    
    
17. 
    The Power of Depth 2 Circuits over Algebras [Citation Graph (, )][DBLP]
    
    
18. 
    Deterministic Polynomial Time Algorithms for Matrix Completion Problems [Citation Graph (, )][DBLP]
    
    
19. 
    From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits [Citation Graph (, )][DBLP]
    
    
20. 
    Schemes for Deterministic Polynomial Factoring. [Citation Graph (, )][DBLP]
    
    
21. 
    Trading GRH for algebra: algorithms for factoring polynomials and related structures. [Citation Graph (, )][DBLP]
    
    
22. 
    An Almost Optimal Rank Bound for Depth-3 Identities. [Citation Graph (, )][DBLP]
    
    
23. 
    Diagonal Circuit Identity Testing and Lower Bounds. [Citation Graph (, )][DBLP]