Person:619895

Available identifiers

zbMath Open agrawal.manindraWikidataQ93029 ScholiaQ93029MaRDI QIDQ619895

List of research outcomes

Publication	Date of Publication	Type
Bootstrapping variables in algebraic circuits	2020-03-04	Paper
Bootstrapping variables in algebraic circuits	2019-08-22	Paper
The query complexity of a permutation-based variant of mastermind	2019-05-03	Paper
Erratum: ``PRIMES is in P	2019-01-18	Paper
On the optimality of lattices for the Coppersmith technique	2018-04-18	Paper
Integer Factoring Using Small Algebraic Dependencies	2018-03-21	Paper
Dimension, pseudorandomness and extraction of pseudorandomness1	2017-11-22	Paper
Dimension, Pseudorandomness and Extraction of Pseudorandomness	2017-07-13	Paper
Approximate Verification of the Symbolic Dynamics of Markov Chains	2017-05-16	Paper
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits	2016-09-02	Paper
Primality and identity testing via Chinese remaindering	2015-11-12	Paper
Approximate Verification of the Symbolic Dynamics of Markov Chains	2015-08-14	Paper
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits	2015-06-08	Paper
Quasi-polynomial hitting-set for set-depth-Δ formulas	2014-08-07	Paper
Jacobian hits circuits	2014-05-13	Paper
A Roadmap for TAMC	2014-04-16	Paper
The Query Complexity of Finding a Hidden Permutation	2013-09-13	Paper
The Discrete Time Behaviour of Restricted Linear Hybrid Automata	2013-02-26	Paper
On the Optimality of Lattices for the Coppersmith Technique	2012-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q2906562	2012-09-05	Paper
On the Arithmetic Complexity of Euler Function	2011-06-17	Paper
The isomorphism conjecture for constant depth reductions	2011-01-18	Paper
Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms	2008-03-19	Paper
Hybrid Systems: Computation and Control	2007-09-25	Paper
The Polynomially Bounded Perfect Matching Problem Is in NC 2	2007-09-03	Paper
Hybrid Systems: Computation and Control	2007-05-02	Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science	2006-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q5491021	2006-09-26	Paper
STACS 2005	2005-12-02	Paper
Hybrid Systems: Computation and Control	2005-11-11	Paper
PRIMES is in P	2005-04-18	Paper
https://portal.mardi4nfdi.de/entity/Q4474207	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4474208	2004-08-04	Paper
For completeness, sublogarithmic space is no space.	2003-01-21	Paper
The satisfiability problem for probabilistic ordered branching programs	2002-06-02	Paper
Reducing the complexity of reductions	2002-05-05	Paper
https://portal.mardi4nfdi.de/entity/Q2709238	2001-05-15	Paper
On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits	2001-03-12	Paper
https://portal.mardi4nfdi.de/entity/Q4527042	2001-03-01	Paper
The Formula Isomorphism Problem	2000-10-18	Paper
Reductions in circuit complexity: An isomorphism theorem and a gap theorem	1999-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q4258573	1999-09-13	Paper
https://portal.mardi4nfdi.de/entity/Q4246718	1999-06-16	Paper
A note on decision versus search for graph automorphism	1997-11-12	Paper
DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization	1997-08-03	Paper
On the isomorphism conjecture for weak reducibilities	1997-03-31	Paper
Geometric sets of low information content	1997-02-27	Paper
Quasi-linear truth-table reductions to \(p\)-selective sets	1997-02-27	Paper
Polynomial-time isomorphism of 1-L-complete sets	1996-11-27	Paper
NP-Creative sets: A new class of creative sets in NP	1996-10-16	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Manindra Agrawal