Manindra Agrawal

发表

For completeness, sublogarithmic space is no space

Manindra Agrawal, 2002, Inf. Process. Lett..

Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Angsheng Li, Manindra Agrawal, S. Barry Cooper, 2012 .

On the optimality of lattices for the coppersmith technique

Osamu Watanabe, Manindra Agrawal, Yoshinori Aono, 2012, Applicable Algebra in Engineering, Communication and Computing.

One-Way Functions and the Isomorphism Conjecture

Osamu Watanabe, Manindra Agrawal, 2009, Electron. Colloquium Comput. Complex..

Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets

Vikraman Arvind, Manindra Agrawal, 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

Geometric Sets of Low Information Content

Vikraman Arvind, Manindra Agrawal, 1996, Theor. Comput. Sci..

Polynomial isomorphism of 1-L-complete sets

Manindra Agrawal, Somenath Biswas, 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

Polynomial time truth-table reductions to p-selective sets

Vikraman Arvind, Manindra Agrawal, 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science

Manindra Agrawal, Anil Seth, Manindra Agrawal, 2002, Lecture Notes in Computer Science.

Primality Tests Based on Fermat's Little Theorem

Manindra Agrawal, 2006, ICDCN.

Quasi-polynomial Hitting-set for Set-depth-Delta Formulas

Nitin Saxena, Manindra Agrawal, Chandan Saha, 2012, Electron. Colloquium Comput. Complex..

Characterizing Small Depth and Small Space Classes by Operators of Higher Type

Heribert Vollmer, Eric Allender, Samir Datta, 2000, Chic. J. Theor. Comput. Sci..

A brief history of polynomial identity testing

Manindra Agrawal, 2014 .

The Polynomially Bounded Perfect Matching Problem Is in NC 2

Manindra Agrawal, Thomas Thierauf, Thanh Minh Hoang, 2007, STACS.

Modulo Information from Nonadaptive Queries to NP

Manindra Agrawal, Thomas Thierauf, Richard Beigel, 1996, Electron. Colloquium Comput. Complex..

Theory and Applications of Models of Computation at the Turing Centenary in China

George Barmpalias, Manindra Agrawal, S. Barry Cooper, 2014, Theor. Comput. Sci..

Arithmetic Circuits: A Chasm at Depth Four

V. Vinay, Manindra Agrawal, V. Vinay, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Hitting-sets for low-distance multilinear depth-3 pdf

Nitin Saxena, Manindra Agrawal, Rohit Gurjar, 2013, Electron. Colloquium Comput. Complex..

Theory and applications of models of computation (TAMC 2008)

Angsheng Li, Manindra Agrawal, 2011, Theor. Comput. Sci..

Bootstrapping variables in algebraic circuits

Nitin Saxena, Manindra Agrawal, Sumanta Ghosh, 2018, Proceedings of the National Academy of Sciences.

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume

Vikraman Arvind, Manindra Agrawal, 2014 .

Impossibility of Derandomizing the Isolation Lemma for all Families

Manindra Agrawal, Thomas Thierauf, Rohit Gurjar, 2020, Electron. Colloquium Comput. Complex..

The Deterministic and Randomized Query Complexity of a Simple Guessing Game

Kurt Mehlhorn, Kasper Green Larsen, Benjamin Doerr, 2012, Electron. Colloquium Comput. Complex..

Primality and identity testing via Chinese remaindering

Manindra Agrawal, Somenath Biswas, Manindra Agrawal, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

The Query Complexity of Finding a Hidden Permutation

Kurt Mehlhorn, Kasper Green Larsen, Benjamin Doerr, 2013, Space-Efficient Data Structures, Streams, and Algorithms.

Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007

Lance Fortnow, Harry Buhrman, Manindra Agrawal, 2008, Algebraic Methods in Computational Complexity.

Primality and identity testing via Chinese remaindering

Manindra Agrawal, Somenath Biswas, 2003, JACM.

Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem

Eric Allender, Manindra Agrawal, Steven Rudich, 1998, J. Comput. Syst. Sci..

A note on decision versus search for graph automorphism

Vikraman Arvind, Manindra Agrawal, 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

Proving Lower Bounds Via Pseudo-random Generators

Manindra Agrawal, Manindra Agrawal, 2005, FSTTCS.

09421 Executive Summary - Algebraic Methods in Computational Complexity

Lance Fortnow, Christopher Umans, Manindra Agrawal, 2009, Algebraic Methods in Computational Complexity.

Equivalence of F-Algebras and Cubic Forms

Nitin Saxena, Manindra Agrawal, Manindra Agrawal, 2006, STACS.

Lazy Rectangular Hybrid Automata

P. S. Thiagarajan, Manindra Agrawal, Manindra Agrawal, 2004, HSCC.

Cryptography: A Survey

Manindra Agrawal, 1999 .

On the isomorphism problem for weak reducibilities

Manindra Agrawal, 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

Theory and applications of models of computation : 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012 : proceedings

Angsheng Li, Manindra Agrawal, S. Cooper, 2012 .

Behavioural Approximations for Restricted Linear Differential Hybrid Automata

Frank Stephan, P. S. Thiagarajan, Shaofa Yang, 2006, HSCC.

On TC/sup 0/, AC/sup 0/, and arithmetic circuits

Eric Allender, Samir Datta, Manindra Agrawal, 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

Integer Factoring Using Small Algebraic Dependencies

Nitin Saxena, Manindra Agrawal, Shubham Sahai Srivastava, 2016, MFCS.

Universal relations

Manindra Agrawal, Somenath Biswas, 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

The Discrete Time Behavior of Lazy Linear Hybrid Automata

P. S. Thiagarajan, Manindra Agrawal, Manindra Agrawal, 2005, HSCC.

Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits

Nitin Saxena, Manindra Agrawal, Ramprasad Saptharishi, 2011, STOC '12.

Theory and A pplications of M odels of Computation

Angsheng Li, Manindra Agrawal, T V Gopal, 2014 .

DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization

Manindra Agrawal, 1997, J. Comput. Syst. Sci..

Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science

Manindra Agrawal, Anil Seth, 2002 .

On the Optimality of Lattices for the Coppersmith Technique

Osamu Watanabe, Manindra Agrawal, Yoshinori Aono, 2012, ACISP.

Quasi-polynomial hitting-set for set-depth-Δ formulas

Nitin Saxena, Manindra Agrawal, Chandan Saha, 2012, STOC '13.

Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness

Manindra Agrawal, Satyadev Nandakumar, Diptarka Chakraborty, 2014, Electron. Colloquium Comput. Complex..

NP-hard Sets and Creativeness over Constant Time Languages

Manindra Agrawal, 1991, FSTTCS.

On the Isomorphism Conjecture for 2-DFA Reductions

Srinivasan Venkatesh, Manindra Agrawal, 1996, Int. J. Found. Comput. Sci..

The satisfiability problem for probabilistic ordered branching programs

Manindra Agrawal, Thomas Thierauf, 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

The Query Complexity of a Permutation-Based Variant of Mastermind pdf

Kurt Mehlhorn, Kasper Green Larsen, Benjamin Doerr, 2019, Discret. Appl. Math..

Pinpointing Computation with Modular Queries in the Boolean Hierarchy

Manindra Agrawal, Thomas Thierauf, Richard Beigel, 1996, FSTTCS.

Reducing the complexity of reductions

Russell Impagliazzo, Toniann Pitassi, Eric Allender, 1997, STOC '97.

Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421)

Christopher Umans, Manindra Agrawal, Thomas Thierauf, 2012, Dagstuhl Reports.

Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings

Ding-Zhu Du, Angsheng Li, Manindra Agrawal, 2008, TAMC.

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009)

Angsheng Li, Manindra Agrawal, S. Barry Cooper, 2010, Math. Struct. Comput. Sci..

09421 Abstracts Collection - Algebraic Methods in Computational Complexity

Lance Fortnow, Christopher Umans, Manindra Agrawal, 2009, Algebraic Methods in Computational Complexity.

Hard Sets and Pseudo-random Generators for Constant Depth Circuits

Manindra Agrawal, Manindra Agrawal, 2001, FSTTCS.

The Boolean isomorphism problem

Manindra Agrawal, Thomas Thierauf, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

Dimension, Pseudorandomness and Extraction of Pseudorandomness

Manindra Agrawal, Satyadev Nandakumar, Diptarka Chakraborty, 2015, FSTTCS.

Algebra in Computational Complexity (Dagstuhl Seminar 14391)

Christopher Umans, Manindra Agrawal, Thomas Thierauf, 2014, Dagstuhl Reports.

On the Arithmetic Complexity of Euler Function

Manindra Agrawal, Manindra Agrawal, 2011, CSR.

A Roadmap for TAMC

Angsheng Li, Manindra Agrawal, S. Barry Cooper, 2014, TAMC.

NP-Creative sets: A new class of creative sets in NP

Manindra Agrawal, Somenath Biswas, 2005, Mathematical systems theory.

A Note on Decision versus Search for Graph Automorphism

Vikraman Arvind, Manindra Agrawal, 1996, Inf. Comput..

Proceedings of the 5th international conference on Theory and applications of models of computation

Dingzhu Du, Angsheng Li, Manindra Agrawal, 2006 .

The Formula Isomorphism Problem

Manindra Agrawal, Thomas Thierauf, 2000, SIAM J. Comput..

Dimension, Pseudorandomness and Extraction of Pseudorandomness

Manindra Agrawal, Satyadev Nandakumar, Diptarka Chakraborty, 2015, FSTTCS.

One-Way Functions and the Berman-Hartmanis Conjecture

Osamu Watanabe, Manindra Agrawal, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

An isomorphism theorem for circuit complexity

Eric Allender, Manindra Agrawal, 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

The First-Order Isomorphism Theorem

Manindra Agrawal, 2001, FSTTCS.

DSPACE(n)=?NSPACE(n): a degree theoretic characterization

Manindra Agrawal, 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

Automorphisms of Finite Rings and Applications to Complexity of Problems

Nitin Saxena, Manindra Agrawal, Manindra Agrawal, 2005, STACS.

Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits

Nitin Saxena, Manindra Agrawal, Ramprasad Saptharishi, 2016, SIAM J. Comput..

Towards uniform AC/sup 0/-isomorphisms

Manindra Agrawal, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

Reducing Randomness via Chinese Remaindering

Manindra Agrawal, Somenath Biswas, 1999, Electron. Colloquium Comput. Complex..

The Discrete Time Behaviour of Restricted Linear Hybrid Automata

Frank Stephan, P. S. Thiagarajan, Shaofa Yang, 2012, Modern Applications of Automata Theory.

Pseudo-random generators and structure of complete degrees

Manindra Agrawal, Manindra Agrawal, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits pdf

Nitin Saxena, Manindra Agrawal, Rohit Gurjar, 2014, SIAM J. Comput..

On TC0, AC0, and Arithmetic Circuits

Eric Allender, Samir Datta, Manindra Agrawal, 2000, J. Comput. Syst. Sci..

Quasi-Linear Truth-Table Reductions to p-Selective Sets

Vikraman Arvind, Manindra Agrawal, 1996, Theor. Comput. Sci..

Approximate Verification of the Symbolic Dynamics of Markov Chains

P. S. Thiagarajan, Manindra Agrawal, Blaise Genest, 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

The isomorphism conjecture for constant depth reductions

Manindra Agrawal, 2011, J. Comput. Syst. Sci..

On derandomizing tests for certain polynomial identities

Manindra Agrawal, Manindra Agrawal, 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good pdf

Nitin Saxena, Manindra Agrawal, Michael A. Forbes, 2017, Electron. Colloquium Comput. Complex..

Reducing the complexity of reductions

Russell Impagliazzo, Toniann Pitassi, Eric Allender, 2001, computational complexity.

Polynomial-Time Isomorphism of 1-L-Complete Sets

Manindra Agrawal, Somenath Biswas, 1996, J. Comput. Syst. Sci..

Perspectives in Computational Complexity

Vikraman Arvind, Manindra Agrawal, 2014 .

On the Isomorphism Conjecture for Weak Reducibilities

Manindra Agrawal, 1996, J. Comput. Syst. Sci..

PRIMES is in

Neeraj Kayal, Nitin Saxena, Manindra Agrawal, 2002 .

Towards Uniform AC0 -Isomorphisms

Manindra Agrawal, 2001 .

The Isomorphism Conjecture for NP

Manindra Agrawal, 2011 .

Determinant versus permanent

Manindra Agrawal, 2006 .