Nitin Saxena - RankMe

134 papers A* 11A 11B 8C 1Journal 96Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A primer on the closure of algebraic complexity classes under factoring. CoRR C. S. Bhargav, Prateek Dwivedi, Nitin Saxena
2025	J	`jnl`	A primer on the closure of algebraic complexity classes under factoring. Electron. Colloquium Comput. Complex. C. S. Bhargav, Prateek Dwivedi, Nitin Saxena
2025	J	`jnl`	Complexity of counting points on curves and the factor P CoRR Diptajit Roy, Nitin Saxena, Madhavan Venkatesh
2025	J	`jnl`	Derandomization via Symmetric Polytopes: Poly-time Factorization of Certain Sparse Polynomials. ACM Trans. Comput. Theory Pranav Bisht, Nitin Saxena
2025	J	`jnl`	Lower bounds for the sum of small-size algebraic branching programs. Theor. Comput. Sci. C. S. Bhargav, Prateek Dwivedi, Nitin Saxena
2025	A*	`conf`	Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals. STOC Abhibhav Garg, Rafael Oliveira, Nitin Saxena
2025	J	`jnl`	Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals. CoRR Abhibhav Garg, Rafael Oliveira, Nitin Saxena
2025	J	`jnl`	Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals. Electron. Colloquium Comput. Complex. Abhibhav Garg, Rafael Mendes de Oliveira, Nitin Saxena
2024	J	`jnl`	How Easy Is It to Describe Hard Polynomials?: Technical Perspective. Commun. ACM Nitin Saxena
2024	J	`jnl`	Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. ACM Trans. Comput. Theory C. S. Bhargav, Sagnik Dutta, Nitin Saxena
2024	A*	`conf`	Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring. STOC C. S. Bhargav, Prateek Dwivedi, Nitin Saxena
2024	C	`conf`	Lower Bounds for the Sum of Small-Size Algebraic Branching Programs. TAMC C. S. Bhargav, Prateek Dwivedi, Nitin Saxena
2024	J	`jnl`	Solving polynomial systems over non-fields and applications to modular polynomial factoring. J. Symb. Comput. Sayak Chakrabarti, Ashish Dwivedi, Nitin Saxena
2024	J	`jnl`	Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply VP ≠q VNP. Comput. Complex. Pranjal Dutta, Nitin Saxena, Thomas Thierauf
2023	B	`conf`	An effective description of the roots of bivariates mod pk and the related Igusa's local zeta function. ISSAC Sayak Chakrabarti, Nitin Saxena
2023	J	`jnl`	Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits. CoRR Pranjal Dutta, Prateek Dwivedi, Nitin Saxena
2023	J	`jnl`	Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q. Comput. Complex. Rishabh Batra, Nitin Saxena, Devansh Shringi
2023	J	`jnl`	VDOO: A Short, Fast, Post-Quantum Multivariate Digital Signature Scheme. CoRR Anindya Ganguly, Angshuman Karmakar, Nitin Saxena
2023	J	`jnl`	VDOO: A Short, Fast, Post-Quantum Multivariate Digital Signature Scheme. IACR Cryptol. ePrint Arch. Anindya Ganguly, Angshuman Karmakar, Nitin Saxena
2023	—	`conf`	VDOO: A Short, Fast, Post-quantum Multivariate Digital Signature Scheme. INDOCRYPT (2) Anindya Ganguly, Angshuman Karmakar, Nitin Saxena
2022	—	`conf`	Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials. FSTTCS Pranav Bisht, Nitin Saxena
2022	J	`jnl`	Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring. J. ACM Pranjal Dutta, Nitin Saxena, Amit Sinhababu
2022	B	`conf`	Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. MFCS C. S. Bhargav, Sagnik Dutta, Nitin Saxena
2022	A*	`conf`	Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits. FOCS Pranjal Dutta, Nitin Saxena
2021	A	`conf`	A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization. ITCS Pranjal Dutta, Nitin Saxena, Thomas Thierauf
2021	J	`jnl`	Blackbox identity testing for sum of special ROABPs and its border class. Comput. Complex. Pranav Bisht, Nitin Saxena
2021	A*	`conf`	Demystifying the border of depth-3 algebraic circuits. FOCS Pranjal Dutta, Prateek Dwivedi, Nitin Saxena
2021	A	`conf`	Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits. CCC Pranjal Dutta, Prateek Dwivedi, Nitin Saxena
2021	J	`jnl`	Efficiently factoring polynomials modulo J. Symb. Comput. Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2020	—	`ed.`	40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference), December 14-18, 2020 FSTTCS Nitin Saxena, Sunil Simon
2020	J	`jnl`	Computing Igusa's local zeta function of univariates in deterministic polynomial-time. CoRR Ashish Dwivedi, Nitin Saxena
2020	J	`jnl`	Computing Igusa's local zeta function of univariates in deterministic polynomial-time. Electron. Colloquium Comput. Complex. Ashish Dwivedi, Nitin Saxena
2020	J	`jnl`	Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT. Electron. Colloquium Comput. Complex. Pranjal Dutta, Nitin Saxena, Thomas Thierauf
2020	J	`jnl`	Poly-time blackbox identity testing for sum of log-variate constant-width ROABPs. Electron. Colloquium Comput. Complex. Pranav Bisht, Nitin Saxena
2020	J	`jnl`	Special-case Algorithms for Blackbox Radical Membership, Nullstellensatz and Transcendence Degree. CoRR Abhibhav Garg, Nitin Saxena
2020	B	`conf`	Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree. ISSAC Abhibhav Garg, Nitin Saxena
2019	J	`jnl`	Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field. Theory Comput. Zeyu Guo, Nitin Saxena, Amit Sinhababu
2019	A	`conf`	Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications. CCC Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019	J	`jnl`	Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications. CoRR Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019	J	`jnl`	Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications. Electron. Colloquium Comput. Complex. Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019	B	`conf`	Efficiently Factoring Polynomials Modulo p4. ISSAC Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019	J	`jnl`	Efficiently factoring polynomials modulo $p^4$. Electron. Colloquium Comput. Complex. Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019	J	`jnl`	Efficiently factoring polynomials modulo p CoRR Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019	J	`jnl`	Research in theoretical computer science. Commun. ACM Meena Mahajan, Madhavan Mukund, Nitin Saxena
2018	A	`conf`	Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity. CCC Zeyu Guo, Nitin Saxena, Amit Sinhababu
2018	J	`jnl`	Algebraic dependencies and PSPACE algorithms in approximative complexity. CoRR Zeyu Guo, Nitin Saxena, Amit Sinhababu
2018	J	`jnl`	Algebraic dependencies and PSPACE algorithms in approximative complexity. Electron. Colloquium Comput. Complex. Zeyu Guo, Nitin Saxena, Amit Sinhababu
2018	J	`jnl`	Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. Comput. Complex. Anurag Pandey, Nitin Saxena, Amit Sinhababu
2018	A*	`conf`	Bootstrapping variables in algebraic circuits. STOC Manindra Agrawal, Sumanta Ghosh, Nitin Saxena
2018	J	`jnl`	Bootstrapping variables in algebraic circuits. Electron. Colloquium Comput. Complex. Manindra Agrawal, Sumanta Ghosh, Nitin Saxena
2018	A*	`conf`	Discovering the roots: uniform closure results for algebraic classes under factoring. STOC Pranjal Dutta, Nitin Saxena, Amit Sinhababu
2018	J	`jnl`	Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields. Algorithmica Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
2018	A*	`conf`	Towards Blackbox Identity Testing of Log-Variate Circuits. ICALP Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
2018	J	`jnl`	Towards blackbox identity testing of log-variate circuits. Electron. Colloquium Comput. Complex. Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
2017	J	`jnl`	Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. Comput. Complex. Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
2017	J	`jnl`	Discovering the roots: Uniform closure results for algebraic classes under factoring. CoRR Pranjal Dutta, Nitin Saxena, Amit Sinhababu
2017	J	`jnl`	Discovering the roots: Uniform closure results for algebraic classes under factoring. Electron. Colloquium Comput. Complex. Pranjal Dutta, Nitin Saxena, Amit Sinhababu
2017	J	`jnl`	Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs. Theory Comput. Rohit Gurjar, Arpita Korwar, Nitin Saxena
2017	B	`conf`	Irreducibility and Deterministic r-th Root Finding over Finite Fields. ISSAC Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena
2017	J	`jnl`	Irreducibility and deterministic r-th root finding over finite fields. Electron. Colloquium Comput. Complex. Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena
2017	J	`jnl`	Irreducibility and r-th root finding over finite fields. CoRR Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena
2017	J	`jnl`	Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good. CoRR Manindra Agrawal, Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
2017	J	`jnl`	Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good. Electron. Colloquium Comput. Complex. Manindra Agrawal, Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
2016	B	`conf`	Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. MFCS Anurag Pandey, Nitin Saxena, Amit Sinhababu
2016	A	`conf`	Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs. CCC Rohit Gurjar, Arpita Korwar, Nitin Saxena
2016	J	`jnl`	Identity Testing for constant-width, and commutative, read-once oblivious ABPs. CoRR Rohit Gurjar, Arpita Korwar, Nitin Saxena
2016	J	`jnl`	Identity Testing for constant-width, and commutative, read-once oblivious ABPs. Electron. Colloquium Comput. Complex. Rohit Gurjar, Arpita Korwar, Nitin Saxena
2016	B	`conf`	Integer Factoring Using Small Algebraic Dependencies. MFCS Manindra Agrawal, Nitin Saxena, Shubham Sahai Srivastava
2016	J	`jnl`	Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. SIAM J. Comput. Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2015	A	`conf`	Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs. CCC Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
2015	J	`jnl`	Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM J. Comput. Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
2015	J	`jnl`	Polynomial Interpolation and Identity Testing from High Powers over Finite Fields. CoRR Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
2014	J	`jnl`	Deterministic Identity Testing for Sum of Read Once ABPs. CoRR Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
2014	J	`jnl`	Deterministic Identity Testing for Sum of Read Once ABPs. Electron. Colloquium Comput. Complex. Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
2014	J	`jnl`	Deterministic polynomial factoring and association schemes. LMS J. Comput. Math. Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2014	J	`jnl`	Hitting-sets for ROABP and Sum of Set-Multilinear circuits. CoRR Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
2014	J	`jnl`	Hitting-sets for ROABP and Sum of Set-Multilinear circuits. Electron. Colloquium Comput. Complex. Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
2014	J	`jnl`	Progress on Polynomial Identity Testing - II. CoRR Nitin Saxena
2013	J	`jnl`	A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Comput. Complex. Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2013	J	`jnl`	Algebraic independence and blackbox identity testing. Inf. Comput. Malte Beecken, Johannes Mittmann, Nitin Saxena
2013	J	`jnl`	From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits. J. ACM Nitin Saxena, C. Seshadhri
2013	J	`jnl`	Hitting-sets for low-distance multilinear depth-3. CoRR Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
2013	J	`jnl`	Hitting-sets for low-distance multilinear depth-3. Electron. Colloquium Comput. Complex. Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
2013	J	`jnl`	Progress on Polynomial Identity Testing - II. Electron. Colloquium Comput. Complex. Nitin Saxena
2013	A*	`conf`	Quasi-polynomial hitting-set for set-depth-Δ formulas. STOC Manindra Agrawal, Chandan Saha, Nitin Saxena
2012	J	`jnl`	Algebraic Independence in Positive Characteristic - A p-Adic Calculus. Electron. Colloquium Comput. Complex. Johannes Mittmann, Nitin Saxena, Peter Scheiblechner
2012	J	`jnl`	Algebraic Independence in Positive Characteristic -- A p-Adic Calculus CoRR Johannes Mittmann, Nitin Saxena, Peter Scheiblechner
2012	J	`jnl`	Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter. SIAM J. Comput. Nitin Saxena, C. Seshadhri
2012	J	`jnl`	Deterministic Polynomial Factoring and Association Schemes CoRR Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2012	J	`jnl`	Deterministic Polynomial Factoring and Association Schemes. Electron. Colloquium Comput. Complex. Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2012	A*	`conf`	Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. STOC Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2012	J	`jnl`	Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas. Electron. Colloquium Comput. Complex. Manindra Agrawal, Chandan Saha, Nitin Saxena
2012	J	`jnl`	Quasi-polynomial Hitting-set for Set-depth-Delta Formulas CoRR Manindra Agrawal, Chandan Saha, Nitin Saxena
2012	J	`jnl`	Trading GRH for algebra: Algorithms for factoring polynomials and related structures. Math. Comput. Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena
2011	J	`jnl`	A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Electron. Colloquium Comput. Complex. Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2011	J	`jnl`	Algebraic Independence and Blackbox Identity Testing CoRR Malte Beecken, Johannes Mittmann, Nitin Saxena
2011	—	`conf`	Algebraic Independence and Blackbox Identity Testing. ICALP (2) Malte Beecken, Johannes Mittmann, Nitin Saxena
2011	J	`jnl`	Algebraic Independence and Blackbox Identity Testing. Electron. Colloquium Comput. Complex. Malte Beecken, Johannes Mittmann, Nitin Saxena
2011	J	`jnl`	An Almost Optimal Rank Bound for Depth-3 Identities. SIAM J. Comput. Nitin Saxena, C. Seshadhri
2011	A*	`conf`	Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. STOC Nitin Saxena, C. Seshadhri
2011	J	`jnl`	Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits CoRR Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2011	J	`jnl`	Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. Electron. Colloquium Comput. Complex. Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2010	J	`jnl`	Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter CoRR Nitin Saxena, C. Seshadhri
2010	J	`jnl`	Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. Electron. Colloquium Comput. Complex. Nitin Saxena, C. Seshadhri
2010	J	`jnl`	Deterministic Polynomial Time Algorithms for Matrix Completion Problems. SIAM J. Comput. Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2010	A*	`conf`	From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. FOCS Nitin Saxena, C. Seshadhri
2010	J	`jnl`	From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits CoRR Nitin Saxena, C. Seshadhri
2010	J	`jnl`	From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits. Electron. Colloquium Comput. Complex. Nitin Saxena, C. Seshadhri
2009	A	`conf`	An Almost Optimal Rank Bound for Depth-3 Identities. CCC Nitin Saxena, C. Seshadhri
2009	J	`jnl`	Deterministic Polynomial Time Algorithms for Matrix Completion Problems CoRR Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2009	J	`jnl`	Deterministic Polynomial Time Algorithms for Matrix Completion Problems. Electron. Colloquium Comput. Complex. Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2009	J	`jnl`	Progress on Polynomial Identity Testing. Bull. EATCS Nitin Saxena
2009	J	`jnl`	Progress on Polynomial Identity Testing. Electron. Colloquium Comput. Complex. Nitin Saxena
2009	B	`conf`	Schemes for deterministic polynomial factoring. ISSAC Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2009	J	`jnl`	The Power of Depth 2 Circuits over Algebras CoRR Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2009	—	`conf`	The Power of Depth 2 Circuits over Algebras. FSTTCS Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2009	J	`jnl`	The Power of Depth 2 Circuits over Algebras. Electron. Colloquium Comput. Complex. Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2008	J	`jnl`	An Almost Optimal Rank Bound for Depth-3 Identities CoRR Nitin Saxena, C. Seshadhri
2008	J	`jnl`	An Almost Optimal Rank Bound for Depth-3 Identities. Electron. Colloquium Comput. Complex. Nitin Saxena, C. Seshadhri
2008	—	`conf`	Diagonal Circuit Identity Testing and Lower Bounds. ICALP (1) Nitin Saxena
2008	J	`jnl`	Schemes for Deterministic Polynomial Factoring CoRR Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2008	J	`jnl`	Schemes for Deterministic Polynomial Factoring. Electron. Colloquium Comput. Complex. Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2008	J	`jnl`	Trading GRH for algebra: algorithms for factoring polynomials and related structures CoRR Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena
2008	J	`jnl`	Trading GRH for algebra: algorithms for factoring polynomials and related structures. Electron. Colloquium Comput. Complex. Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena
2007	—	`conf`	Diagonal Circuit Identity Testing and Lower Bounds. Algebraic Methods in Computational Complexity Nitin Saxena
2007	J	`jnl`	Diagonal Circuit Identity Testing and Lower Bounds. Electron. Colloquium Comput. Complex. Nitin Saxena
2007	J	`jnl`	Polynomial Identity Testing for Depth 3 Circuits. Comput. Complex. Neeraj Kayal, Nitin Saxena
2006	J	`jnl`	Complexity of Ring Morphism Problems. Comput. Complex. Neeraj Kayal, Nitin Saxena
2006	A	`conf`	Equivalence of F-Algebras and Cubic Forms. STACS Manindra Agrawal, Nitin Saxena
2006	A	`conf`	Polynomial Identity Testing for Depth 3 Circuits. CCC Neeraj Kayal, Nitin Saxena
2005	A	`conf`	Automorphisms of Finite Rings and Applications to Complexity of Problems. STACS Manindra Agrawal, Nitin Saxena
2005	A	`conf`	On the Ring Isomorphism and Automorphism Problems. CCC Neeraj Kayal, Nitin Saxena
2005	J	`jnl`	Polynomial Identity Testing for Depth 3 Circuits Electron. Colloquium Comput. Complex. Neeraj Kayal, Nitin Saxena
2004	J	`jnl`	On the Ring Isomorphism & Automorphism Problems Electron. Colloquium Comput. Complex. Neeraj Kayal, Nitin Saxena