Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Manindra Agrawal - MaRDI portal

Manindra Agrawal

From MaRDI portal
(Redirected from Person:232301)
Person:619895

Available identifiers

zbMath Open agrawal.manindraDBLPa/ManindraAgrawalWikidataQ93029 ScholiaQ93029MaRDI QIDQ619895

List of research outcomes





PublicationDate of PublicationType
Pinpointing computation with modular queries in the Boolean hierarchy2024-07-05Paper
Bootstrapping variables in algebraic circuits2020-03-04Paper
Bootstrapping variables in algebraic circuits2019-08-22Paper
The query complexity of a permutation-based variant of mastermind2019-05-03Paper
Erratum: ``PRIMES is in P2019-01-18Paper
On the optimality of lattices for the Coppersmith technique2018-04-18Paper
Integer Factoring Using Small Algebraic Dependencies2018-03-21Paper
Dimension, pseudorandomness and extraction of pseudorandomness12017-11-22Paper
Dimension, Pseudorandomness and Extraction of Pseudorandomness2017-07-13Paper
Approximate Verification of the Symbolic Dynamics of Markov Chains2017-05-16Paper
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits2016-09-02Paper
Primality and identity testing via Chinese remaindering2015-11-12Paper
Approximate Verification of the Symbolic Dynamics of Markov Chains2015-08-14Paper
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits2015-06-08Paper
Quasi-polynomial hitting-set for set-depth-Δ formulas2014-08-07Paper
Jacobian hits circuits2014-05-13Paper
A Roadmap for TAMC2014-04-16Paper
The Query Complexity of Finding a Hidden Permutation2013-09-13Paper
The Discrete Time Behaviour of Restricted Linear Hybrid Automata2013-02-26Paper
On the Optimality of Lattices for the Coppersmith Technique2012-09-07Paper
https://portal.mardi4nfdi.de/entity/Q29065622012-09-05Paper
On the Arithmetic Complexity of Euler Function2011-06-17Paper
The isomorphism conjecture for constant depth reductions2011-01-18Paper
Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms2008-03-19Paper
Hybrid Systems: Computation and Control2007-09-25Paper
The Polynomially Bounded Perfect Matching Problem Is in NC 22007-09-03Paper
Hybrid Systems: Computation and Control2007-05-02Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
https://portal.mardi4nfdi.de/entity/Q54910212006-09-26Paper
STACS 20052005-12-02Paper
Hybrid Systems: Computation and Control2005-11-11Paper
PRIMES is in P2005-04-18Paper
https://portal.mardi4nfdi.de/entity/Q44742072004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44742082004-08-04Paper
For completeness, sublogarithmic space is no space.2003-01-21Paper
The satisfiability problem for probabilistic ordered branching programs2002-06-02Paper
Reducing the complexity of reductions2002-05-05Paper
https://portal.mardi4nfdi.de/entity/Q27092382001-05-15Paper
On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits2001-03-12Paper
https://portal.mardi4nfdi.de/entity/Q45270422001-03-01Paper
The Formula Isomorphism Problem2000-10-18Paper
Reductions in circuit complexity: An isomorphism theorem and a gap theorem1999-09-29Paper
https://portal.mardi4nfdi.de/entity/Q42585731999-09-13Paper
https://portal.mardi4nfdi.de/entity/Q42467181999-06-16Paper
A note on decision versus search for graph automorphism1997-11-12Paper
DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization1997-08-03Paper
On the isomorphism conjecture for weak reducibilities1997-03-31Paper
Geometric sets of low information content1997-02-27Paper
Quasi-linear truth-table reductions to \(p\)-selective sets1997-02-27Paper
Polynomial-time isomorphism of 1-L-complete sets1996-11-27Paper
NP-Creative sets: A new class of creative sets in NP1996-10-16Paper

Research outcomes over time

This page was built for person: Manindra Agrawal