( en | de | ru )

 

Disambiguation of "Agrawal, Manindra"

Author of the publication

copydeleteadd this publication to your clipboard
Dimension, Pseudorandomness and Extraction of Pseudorandomness.

, , , and . FSTTCS, volume 45 of LIPIcs, page 221-235. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Deepashri Agrawal

Mukesh Agrawal

Mudit Agrawal

Hemant Agrawal

Milan Agrawal

 

Other publications of authors with the same name

Integer Factoring Using Small Algebraic Dependencies., , and . MFCS, volume 58 of LIPIcs, page 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The Discrete Time Behaviour of Restricted Linear Hybrid Automata., , , and . Modern Applications of Automata Theory, volume 2 of IISc Research Monographs Series, World Scientific, (2012)Hard Sets and Pseudo-random Generators for Constant Depth Circuits.. FSTTCS, volume 2245 of Lecture Notes in Computer Science, page 58-69. Springer, (2001)Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem., , and . J. Comput. Syst. Sci., 57 (2): 127-143 (1998)Polynomial-Time Isomorphism of 1-L-Complete Sets., and . J. Comput. Syst. Sci., 53 (2): 155-160 (1996)DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization.. J. Comput. Syst. Sci., 54 (3): 383-392 (1997)Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits., , , and . Electron. Colloquium Comput. Complex., (2011)Impossibility of Derandomizing the Isolation Lemma for all Families., , and . Electron. Colloquium Comput. Complex., (2020)On Derandomizing Tests for Certain Polynomial Identities.. CCC, page 355-. IEEE Computer Society, (2003)Pseudo-Random Generators and Structure of Complete Degrees.. CCC, page 139-147. IEEE Computer Society, (2002)