( en | de | ru )

 

Disambiguation of "Allender, Eric"

Author of the publication

copydeleteadd this publication to your clipboard
On Generating Solved Instances of Computational Problems.

, , , , and . CRYPTO, volume 403 of Lecture Notes in Computer Science, page 297-310. Springer, (1988)

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.

Ull Erich

Hauke Erichsen

Gerda Erich

Klaus Erichson

Badrian Erich

 

Other publications of authors with the same name

Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table., , , , and . SIAM J. Comput., 38 (1): 63-84 (2008)Cryptographic hardness under projections for time-bounded Kolmogorov complexity., , , and . Theor. Comput. Sci., 940 (Part): 206-224 (2023)Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series., , and . Theory Comput. Syst., 53 (3): 503-506 (2013)Dual VP Classes., , and . Electron. Colloquium Comput. Complex., (2014)The Minimum Oracle Circuit Size Problem., , and . Electron. Colloquium Comput. Complex., (2014)The Non-Hardness of Approximating Circuit Size., , and . Electron. Colloquium Comput. Complex., (2018)Complexity of regular functions., and . J. Comput. Syst. Sci., (2019)Kolmogorov Complexity Characterizes Statistical Zero Knowledge., , and . ITCS, volume 251 of LIPIcs, page 3:1-3:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Isomorphisms and 1-L Reductions.. SCT, volume 223 of Lecture Notes in Computer Science, page 12-22. Springer, (1986)An Isomorphism Theorem for Circuit Complexity., and . CCC, page 2-11. IEEE Computer Society, (1996)