The following pages link to Manindra Agrawal (Q619895):
Displaying 50 items.
- (Q232301) (redirect page) (← links)
- The isomorphism conjecture for constant depth reductions (Q619896) (← links)
- A note on decision versus search for graph automorphism (Q675067) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- Geometric sets of low information content (Q1351460) (← links)
- Quasi-linear truth-table reductions to \(p\)-selective sets (Q1351469) (← links)
- DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization (Q1362330) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Erratum: ``PRIMES is in P'' (Q1711495) (← links)
- The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
- On the optimality of lattices for the Coppersmith technique (Q1745898) (← links)
- PRIMES is in P (Q1772458) (← links)
- Polynomial-time isomorphism of 1-L-complete sets (Q1816724) (← links)
- On the isomorphism conjecture for weak reducibilities (Q1816734) (← links)
- For completeness, sublogarithmic space is no space. (Q1853022) (← links)
- (Q2709238) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- The Query Complexity of Finding a Hidden Permutation (Q2848962) (← links)
- (Q2906562) (← links)
- On the Optimality of Lattices for the Coppersmith Technique (Q2907386) (← links)
- Approximate Verification of the Symbolic Dynamics of Markov Chains (Q2986781) (← links)
- On the Arithmetic Complexity of Euler Function (Q3007615) (← links)
- Primality and identity testing via Chinese remaindering (Q3452497) (← links)
- The Polynomially Bounded Perfect Matching Problem Is in NC 2 (Q3590959) (← links)
- (Q4246718) (← links)
- (Q4258573) (← links)
- (Q4474207) (← links)
- (Q4474208) (← links)
- The Formula Isomorphism Problem (Q4507381) (← links)
- (Q4527042) (← links)
- Dimension, pseudorandomness and extraction of pseudorandomness1 (Q4593496) (← links)
- Integer Factoring Using Small Algebraic Dependencies (Q4608563) (← links)
- NP-Creative sets: A new class of creative sets in NP (Q4895816) (← links)
- The Discrete Time Behaviour of Restricted Linear Hybrid Automata (Q4907866) (← links)
- Bootstrapping variables in algebraic circuits (Q5218580) (← links)
- Bootstrapping variables in algebraic circuits (Q5230371) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Dimension, Pseudorandomness and Extraction of Pseudorandomness (Q5275369) (← links)
- Hybrid Systems: Computation and Control (Q5307451) (← links)
- A Roadmap for TAMC (Q5410630) (← links)
- Jacobian hits circuits (Q5415504) (← links)
- Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms (Q5449791) (← links)
- (Q5491021) (← links)
- Quasi-polynomial hitting-set for set-depth-Δ formulas (Q5495802) (← links)
- Approximate Verification of the Symbolic Dynamics of Markov Chains (Q5501948) (← links)
- Hybrid Systems: Computation and Control (Q5703956) (← links)
- STACS 2005 (Q5710667) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897760) (← links)
- Hybrid Systems: Computation and Control (Q5898966) (← links)
- The satisfiability problem for probabilistic ordered branching programs (Q5956791) (← links)
