( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem.

, , и . J. Comput. Syst. Sci., 57 (2): 127-143 (1998)

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.

Deepashri Agrawal

Mudit Agrawal

Mukesh Agrawal

Milan Agrawal

Hemant Agrawal

 

Другие публикации лиц с тем же именем

Quasi-polynomial hitting-set for set-depth-Δ formulas., , и . STOC, стр. 321-330. ACM, (2013)The query complexity of a permutation-based variant of Mastermind., , , , , и . Discret. Appl. Math., (2019)Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas., , и . Electron. Colloquium Comput. Complex., (2012)Towards Uniform AC0 - Isomorphisms.. CCC, стр. 13-20. IEEE Computer Society, (2001)On the Isomorphism Problem for Weak Reducibilities.. SCT, стр. 338-355. IEEE Computer Society, (1994)Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets., и . SCT, стр. 264-276. IEEE Computer Society, (1995)Automorphisms of Finite Rings and Applications to Complexity of Problems., и . STACS, том 3404 из Lecture Notes in Computer Science, стр. 1-17. Springer, (2005)Reducing the Complexity of Reductions., , , , и . STOC, стр. 730-738. ACM, (1997)Integer Factoring Using Small Algebraic Dependencies., , и . MFCS, том 58 из LIPIcs, стр. 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization.. J. Comput. Syst. Sci., 54 (3): 383-392 (1997)