( en | de | ru )

 

Disambiguation of "Agrawal, Manindra"

Author of the publication

copydeleteadd this publication to your clipboard
An Isomorphism Theorem for Circuit Complexity.

, and . CCC, page 2-11. IEEE Computer Society, (1996)

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

Reducing the Complexity of Reductions., , , , and . STOC, page 730-738. ACM, (1997)The query complexity of a permutation-based variant of Mastermind., , , , , and . Discret. Appl. Math., (2019)Quasi-polynomial hitting-set for set-depth-Δ formulas., , and . STOC, page 321-330. ACM, (2013)Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas., , and . Electron. Colloquium Comput. Complex., (2012)On the Isomorphism Problem for Weak Reducibilities.. SCT, page 338-355. IEEE Computer Society, (1994)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)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)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)