Author of the publication

Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good.

, , , and . Electron. Colloquium Comput. Complex., (2017)

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.

 

Other publications of authors with the same name

Hard Sets and Pseudo-random Generators for Constant Depth Circuits.. FSTTCS, volume 2245 of Lecture Notes in Computer Science, page 58-69. Springer, (2001)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)Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem., , and . J. Comput. Syst. Sci., 57 (2): 127-143 (1998)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)Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits., , , and . STOC, page 599-614. ACM, (2012)A Roadmap for TAMC., , , and . TAMC, volume 8402 of Lecture Notes in Computer Science, page 1-6. Springer, (2014)Behavioural Approximations for Restricted Linear Differential Hybrid Automata., , , and . HSCC, volume 3927 of Lecture Notes in Computer Science, page 4-18. Springer, (2006)Primality Tests Based on Fermat's Little Theorem.. ICDCN, volume 4308 of Lecture Notes in Computer Science, page 288-293. Springer, (2006)The Discrete Time Behavior of Lazy Linear Hybrid Automata., and . HSCC, volume 3414 of Lecture Notes in Computer Science, page 55-69. Springer, (2005)