( en | de | ru )

 

Disambiguation of "Agrawal, Manindra"

Author of the publication

copydeleteadd this publication to your clipboard
Pseudo-Random Generators and Structure of Complete Degrees.

. CCC, page 139-147. IEEE Computer Society, (2002)

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

Milan Agrawal

Hemant Agrawal

 

Other publications of authors with the same name

Quasi-polynomial hitting-set for set-depth-Δ formulas., , and . STOC, page 321-330. ACM, (2013)The query complexity of a permutation-based variant of Mastermind., , , , , and . Discret. Appl. Math., (2019)Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas., , and . Electron. Colloquium Comput. Complex., (2012)Reducing the Complexity of Reductions., , , , and . STOC, page 730-738. ACM, (1997)Automorphisms of Finite Rings and Applications to Complexity of Problems., and . STACS, volume 3404 of Lecture Notes in Computer Science, page 1-17. Springer, (2005)Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets., and . SCT, page 264-276. IEEE Computer Society, (1995)Towards Uniform AC0 - Isomorphisms.. CCC, page 13-20. IEEE Computer Society, (2001)On the Isomorphism Problem for Weak Reducibilities.. SCT, page 338-355. IEEE Computer Society, (1994)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)