×

zbMATH — the first resource for mathematics

Agrawal, Manindra

Compute Distance To:
Author ID: agrawal.manindra Recent zbMATH articles by "Agrawal, Manindra"
Published as: Agrawal, M.; Agrawal, Manindra
Homepage: https://www.cse.iitk.ac.in/users/manindra/
External Links: MGP · Wikidata · dblp · GND
Awards: Clay Research Award (2002)
Documents Indexed: 58 Publications since 1991, including 6 Books

Publications by Year

Citations contained in zbMATH Open

38 Publications have been cited 367 times in 278 Documents Cited by Year
PRIMES is in P. Zbl 1071.11070
Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin
139
2004
The discrete time behavior of lazy linear hybrid automata. Zbl 1078.68069
Agrawal, Manindra; Thiagarajan, P. S.
33
2005
Lazy rectangular hybrid automata. Zbl 1133.68359
Agrawal, Manindra; Thiagarajan, P. S.
31
2004
Proving lower bounds via pseudo-random generators. Zbl 1172.68479
Agrawal, Manindra
22
2005
Primality and identity testing via Chinese remaindering. Zbl 1325.68253
Agrawal, Manindra; Biswas, Somenath
14
2003
Jacobian hits circuits: hitting-sets, lower bounds for depth-\(D\) occur-\(k\) formulas & depth-\(3\) transcendence degree-\(k\) circuits. Zbl 1286.94115
Agrawal, Manindra; Saha, Chandan; Saptharishi, Ramprasad; Saxena, Nitin
11
2012
On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits. Zbl 0956.68060
Agrawal, Manindra; Allender, Eric; Datta, Samir
11
2000
Reducing the complexity of reductions. Zbl 1052.68052
Agrawal, Manindra; Allender, Eric; Impagliazzo, Russell; Pitassi, Toniann; Rudich, Steven
10
2001
The formula isomorphism problem. Zbl 0970.68068
Agrawal, Manindra; Thierauf, Thomas
10
2000
Quasi-linear truth-table reductions to \(p\)-selective sets. Zbl 0871.68082
Agrawal, M.; Arvind, V.
9
1996
Quasi-polynomial hitting-set for set-depth-\({\Delta}\) formulas. Zbl 1293.94140
Agrawal, Manindra; Saha, Chandan; Saxena, Nitin
8
2013
Reductions in circuit complexity: An isomorphism theorem and a gap theorem. Zbl 0921.68037
Agrawal, Manindra; Allender, Eric; Rudich, Steven
7
1998
Hitting-sets for ROABP and sum of set-multilinear circuits. Zbl 1327.68339
Agrawal, Manindra; Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin
6
2015
Approximate verification of the symbolic dynamics of Markov chains. Zbl 1362.68162
Agrawal, Manindra; Akshay, S.; Genest, Blaise; Thiagarajan, P. S.
6
2012
The query complexity of finding a hidden permutation. Zbl 1391.68044
Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt
5
2013
The polynomially bounded perfect matching problem is in NC\(^{2}\). Zbl 1186.68216
Agrawal, Manindra; Hoang, Thanh Minh; Thierauf, Thomas
4
2007
Reducing the complexity of reductions. Zbl 0963.68074
Agrawal, Manindra; Allender, Eric; Impagliazzo, Russell; Pitassi, Toniann; Rudich, Steven
4
1999
On the isomorphism conjecture for weak reducibilities. Zbl 0859.68035
Agrawal, Manindra
4
1996
The query complexity of a permutation-based variant of mastermind. Zbl 1411.91153
Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt
3
2019
On the optimality of lattices for the Coppersmith technique. Zbl 1401.94136
Aono, Yoshinori; Agrawal, Manindra; Satoh, Takakazu; Watanabe, Osamu
3
2018
Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits. Zbl 1350.68292
Agrawal, Manindra; Saha, Chandan; Saptharishi, Ramprasad; Saxena, Nitin
3
2016
The isomorphism conjecture for constant depth reductions. Zbl 1214.68169
Agrawal, Manindra
3
2011
Approximate verification of the symbolic dynamics of Markov chains. Zbl 1321.68367
Agrawal, Manindra; Akshay, S.; Genest, Blaise; Thiagarajan, P. S.
2
2015
On the optimality of lattices for the Coppersmith technique. Zbl 1308.94058
Aono, Yoshinori; Agrawal, Manindra; Satoh, Takakazu; Watanabe, Osamu
2
2012
Determinant versus permanent. Zbl 1100.68037
Agrawal, Manindra
2
2006
For completeness, sublogarithmic space is no space. Zbl 1043.68062
Agrawal, Manindra
2
2002
A note on decision versus search for graph automorphism. Zbl 0876.68079
Agrawal, M.; Arvind, V.
2
1996
Theory and applications of models of computation. 11th annual conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings. Zbl 1284.68014
Gopal, T. V. (ed.); Agrawal, Manindra (ed.); Li, Angsheng (ed.); Cooper, S. Barry (ed.)
1
2014
Equivalence of \(\mathbb{F}\)-algebras and cubic forms. Zbl 1137.68064
Agrawal, Manindra; Saxena, Nitin
1
2006
Automorphisms of finite rings and applications to complexity of problems. Zbl 1119.68093
Agrawal, Manindra; Saxena, Nitin
1
2005
The first-order isomorphism theorem. Zbl 1052.68048
Agrawal, Manindra
1
2001
Hard sets and pseudo-random generators for constant depth circuits. Zbl 1052.68047
Agrawal, Manindra
1
2001
The satisfiability problem for probabilistic ordered branching programs. Zbl 1009.68054
Agrawal, M.; Thierauf, T.
1
2001
The satisfiability problem for probabilistic ordered branching programs. Zbl 0935.68025
Agrawal, Manindra; Thierauf, Thomas
1
1998
DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization. Zbl 0882.68061
Agrawal, Manindra
1
1997
On the isomorphism conjecture for 2-DFA reductions. Zbl 0867.68059
Agrawal, Manindra; Venkatesh, S.
1
1996
Geometric sets of low information content. Zbl 0871.68114
Agrawal, M.; Arvind, V.
1
1996
Polynomial-time isomorphism of 1-L-complete sets. Zbl 0859.68028
Agrawal, Manindra; Biswas, Somenath
1
1996
The query complexity of a permutation-based variant of mastermind. Zbl 1411.91153
Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt
3
2019
On the optimality of lattices for the Coppersmith technique. Zbl 1401.94136
Aono, Yoshinori; Agrawal, Manindra; Satoh, Takakazu; Watanabe, Osamu
3
2018
Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits. Zbl 1350.68292
Agrawal, Manindra; Saha, Chandan; Saptharishi, Ramprasad; Saxena, Nitin
3
2016
Hitting-sets for ROABP and sum of set-multilinear circuits. Zbl 1327.68339
Agrawal, Manindra; Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin
6
2015
Approximate verification of the symbolic dynamics of Markov chains. Zbl 1321.68367
Agrawal, Manindra; Akshay, S.; Genest, Blaise; Thiagarajan, P. S.
2
2015
Theory and applications of models of computation. 11th annual conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings. Zbl 1284.68014
Gopal, T. V. (ed.); Agrawal, Manindra (ed.); Li, Angsheng (ed.); Cooper, S. Barry (ed.)
1
2014
Quasi-polynomial hitting-set for set-depth-\({\Delta}\) formulas. Zbl 1293.94140
Agrawal, Manindra; Saha, Chandan; Saxena, Nitin
8
2013
The query complexity of finding a hidden permutation. Zbl 1391.68044
Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt
5
2013
Jacobian hits circuits: hitting-sets, lower bounds for depth-\(D\) occur-\(k\) formulas & depth-\(3\) transcendence degree-\(k\) circuits. Zbl 1286.94115
Agrawal, Manindra; Saha, Chandan; Saptharishi, Ramprasad; Saxena, Nitin
11
2012
Approximate verification of the symbolic dynamics of Markov chains. Zbl 1362.68162
Agrawal, Manindra; Akshay, S.; Genest, Blaise; Thiagarajan, P. S.
6
2012
On the optimality of lattices for the Coppersmith technique. Zbl 1308.94058
Aono, Yoshinori; Agrawal, Manindra; Satoh, Takakazu; Watanabe, Osamu
2
2012
The isomorphism conjecture for constant depth reductions. Zbl 1214.68169
Agrawal, Manindra
3
2011
The polynomially bounded perfect matching problem is in NC\(^{2}\). Zbl 1186.68216
Agrawal, Manindra; Hoang, Thanh Minh; Thierauf, Thomas
4
2007
Determinant versus permanent. Zbl 1100.68037
Agrawal, Manindra
2
2006
Equivalence of \(\mathbb{F}\)-algebras and cubic forms. Zbl 1137.68064
Agrawal, Manindra; Saxena, Nitin
1
2006
The discrete time behavior of lazy linear hybrid automata. Zbl 1078.68069
Agrawal, Manindra; Thiagarajan, P. S.
33
2005
Proving lower bounds via pseudo-random generators. Zbl 1172.68479
Agrawal, Manindra
22
2005
Automorphisms of finite rings and applications to complexity of problems. Zbl 1119.68093
Agrawal, Manindra; Saxena, Nitin
1
2005
PRIMES is in P. Zbl 1071.11070
Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin
139
2004
Lazy rectangular hybrid automata. Zbl 1133.68359
Agrawal, Manindra; Thiagarajan, P. S.
31
2004
Primality and identity testing via Chinese remaindering. Zbl 1325.68253
Agrawal, Manindra; Biswas, Somenath
14
2003
For completeness, sublogarithmic space is no space. Zbl 1043.68062
Agrawal, Manindra
2
2002
Reducing the complexity of reductions. Zbl 1052.68052
Agrawal, Manindra; Allender, Eric; Impagliazzo, Russell; Pitassi, Toniann; Rudich, Steven
10
2001
The first-order isomorphism theorem. Zbl 1052.68048
Agrawal, Manindra
1
2001
Hard sets and pseudo-random generators for constant depth circuits. Zbl 1052.68047
Agrawal, Manindra
1
2001
The satisfiability problem for probabilistic ordered branching programs. Zbl 1009.68054
Agrawal, M.; Thierauf, T.
1
2001
On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits. Zbl 0956.68060
Agrawal, Manindra; Allender, Eric; Datta, Samir
11
2000
The formula isomorphism problem. Zbl 0970.68068
Agrawal, Manindra; Thierauf, Thomas
10
2000
Reducing the complexity of reductions. Zbl 0963.68074
Agrawal, Manindra; Allender, Eric; Impagliazzo, Russell; Pitassi, Toniann; Rudich, Steven
4
1999
Reductions in circuit complexity: An isomorphism theorem and a gap theorem. Zbl 0921.68037
Agrawal, Manindra; Allender, Eric; Rudich, Steven
7
1998
The satisfiability problem for probabilistic ordered branching programs. Zbl 0935.68025
Agrawal, Manindra; Thierauf, Thomas
1
1998
DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization. Zbl 0882.68061
Agrawal, Manindra
1
1997
Quasi-linear truth-table reductions to \(p\)-selective sets. Zbl 0871.68082
Agrawal, M.; Arvind, V.
9
1996
On the isomorphism conjecture for weak reducibilities. Zbl 0859.68035
Agrawal, Manindra
4
1996
A note on decision versus search for graph automorphism. Zbl 0876.68079
Agrawal, M.; Arvind, V.
2
1996
On the isomorphism conjecture for 2-DFA reductions. Zbl 0867.68059
Agrawal, Manindra; Venkatesh, S.
1
1996
Geometric sets of low information content. Zbl 0871.68114
Agrawal, M.; Arvind, V.
1
1996
Polynomial-time isomorphism of 1-L-complete sets. Zbl 0859.68028
Agrawal, Manindra; Biswas, Somenath
1
1996
all top 5

Cited by 492 Authors

12 Allender, Eric W.
11 Agrawal, Manindra
8 Saxena, Nitin
6 Shpilka, Amir
5 Doerr, Benjamin
5 Doerr, Carola
5 Shparlinski, Igor E.
5 Sutherland, Andrew V.
4 Arvind, Vikraman
4 Beigel, Richard
4 Glaßer, Christian
4 Kayal, Neeraj
4 Limaye, Nutan
4 Saha, Chandan
4 van der Hoeven, Joris
4 Vollmer, Heribert
3 Akshay, S.
3 Chan, Hing-Lun
3 Deng, Yingpu
3 Gasarch, William Ian
3 Gurjar, Rohit
3 Haak, Anselm
3 Harvey, David I.
3 Huang, Dandan
3 Kabanets, Valentine
3 Lazar, Mircea
3 Norrish, Michael
3 Reis, Lucas
3 Santhanam, Rahul
3 Saptharishi, Ramprasad
3 Sastry, S. Shankar
3 Sorenson, Jonathan P.
3 Takayasu, Atsushi
3 Thiagarajan, Pazhamaneri Subramaniam
3 Viola, Emanuele
3 Wang, Fengming
2 Barth, Dominik
2 Beck, Moritz
2 Bernstein, Daniel Julius
2 Berrizbeitia, Pedro
2 Bouyer, Patricia
2 Buhrman, Harry
2 Chen, Ruiwen
2 Chen, Zhixiang
2 Damm, Werner
2 Dose, Titus
2 Ezome, Tony
2 Fu, Bin
2 Grochow, Joshua A.
2 Heemels, W. P. Maurice H.
2 Hitchcock, John M.
2 Jansen, Maurice J.
2 König, Daniel
2 Korwar, Arpita
2 Kunihiro, Noboru
2 Larsen, Kim Guldstrand
2 Lecerf, Grégoire
2 Linhart, Chaim
2 Lohrey, Markus
2 Lygeros, John
2 Mahajan, Meena
2 Maler, Oded
2 Mehlhorn, Kurt
2 Michler, Larissa
2 Miles, Eric
2 Mittmann, Johannes
2 Mukhopadhyay, Partha
2 Pavan, Aduri
2 Pomerance, Carl Bernard
2 Popovych, Roman B.
2 Raghavendra Rao, B. V.
2 Rojas, J. Maurice
2 Sagraloff, Michael
2 Sankaranarayanan, Sriram
2 Satoh, Takakazu
2 Shamir, Ron
2 Silverberg, Alice
2 Srinivasan, Srikanth
2 Tantau, Till
2 Technau, Marc
2 Thierauf, Thomas
2 Torán, Jacobo
2 Torenvliet, Leen
2 van Melkebeek, Dieter
2 Vasudev, Yadu
2 Vishnoi, Nisheeth K.
2 Volk, Ben Lee
2 Volkovich, Ilya
2 Watanabe, Osamu
2 Yang, Shaofa
2 Zhang, Zhenxiang
1 Abatzoglou, Alexander
1 Abdullah, Herish O.
1 Abu-Khzam, Faisal N.
1 Adve, Anshul
1 Afshani, Peyman
1 Alexander, Yong
1 Ambainis, Andris
1 Ames, Aaron D.
1 Amin, Saurabh
...and 392 more Authors
all top 5

Cited in 86 Serials

21 Mathematics of Computation
20 Theoretical Computer Science
15 Computational Complexity
13 Journal of Computer and System Sciences
10 Information Processing Letters
9 Information and Computation
9 Theory of Computing Systems
6 SIAM Journal on Computing
6 Journal of Complexity
6 Algorithmica
5 Journal of Number Theory
5 Journal of Symbolic Computation
5 Finite Fields and their Applications
4 Discrete Applied Mathematics
2 Communications in Mathematical Physics
2 Advances in Mathematics
2 Czechoslovak Mathematical Journal
2 Journal of Algebra
2 Journal of Automated Reasoning
2 Bulletin of the American Mathematical Society. New Series
2 Journal of Mathematical Sciences (New York)
2 Journal of Combinatorial Optimization
2 Journal of the ACM
2 Annals of Mathematics. Second Series
2 RAIRO. Theoretical Informatics and Applications
2 Foundations of Computational Mathematics
2 International Journal of Number Theory
1 Artificial Intelligence
1 Journal of Mathematical Physics
1 Mathematische Semesterberichte
1 Reviews of Modern Physics
1 Rocky Mountain Journal of Mathematics
1 The Mathematical Intelligencer
1 Acta Arithmetica
1 Applied Mathematics and Computation
1 Canadian Mathematical Bulletin
1 Journal of Economic Theory
1 Mathematica Slovaca
1 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods
1 Proceedings of the American Mathematical Society
1 Rendiconti del Circolo Matemàtico di Palermo. Serie II
1 Transactions of the American Mathematical Society
1 Science of Computer Programming
1 Combinatorica
1 Annals of Pure and Applied Logic
1 Constructive Approximation
1 Journal of the American Mathematical Society
1 International Journal of Algebra and Computation
1 International Journal of Foundations of Computer Science
1 Discrete Mathematics and Applications
1 Designs, Codes and Cryptography
1 Games and Economic Behavior
1 International Journal of Computer Mathematics
1 Archive for Mathematical Logic
1 Applicable Algebra in Engineering, Communication and Computing
1 Russian Mathematics
1 Computational Optimization and Applications
1 Formal Methods in System Design
1 Journal de Théorie des Nombres de Bordeaux
1 The Bulletin of Symbolic Logic
1 Séminaire Lotharingien de Combinatoire
1 European Journal of Control
1 Journal of Graph Algorithms and Applications
1 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
1 Journal of Discrete Mathematical Sciences & Cryptography
1 LMS Journal of Computation and Mathematics
1 Journal of the European Mathematical Society (JEMS)
1 Integers
1 Journal of Systems Science and Complexity
1
1 ACM Transactions on Computational Logic
1 Journal of Discrete Algorithms
1 Discrete Optimization
1 Mathematics in Computer Science
1 Advances in Mathematics of Communications
1 Journal of Formalized Reasoning
1 Science China. Mathematics
1 RAIRO. Theoretical Informatics and Applications
1 Games
1 Theory of Computing
1 Carpathian Mathematical Publications
1 Journal of Mathematical Modelling and Algorithms in Operations Research
1 Journal of Logical and Algebraic Methods in Programming
1 Proceedings of the Royal Society of London. A. Mathematical, Physical and Engineering Sciences
1 Cogent Mathematics & Statistics
1 Prikladnaya Diskretnaya Matematika

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.