PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "van Melkebeek, Dieter"

Author of the publication

copydeleteadd this publication to your clipboard
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae.

, , and . Electronic Colloquium on Computational Complexity (ECCC), (2010)

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.

Nina van den Daele University of Stuttgart

Dr. phil. Leo van Waveren University of Stuttgart

Dr. Thijs van Westen University of Stuttgart

Jan Vanvinkenroye University of Stuttgart

Univ. -Prof. Dr. Joris van Slageren University of Stuttgart

 

Other publications of authors with the same name

Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets.. J. Comput. Syst. Sci., 57 (2): 213-232 (1998)Language compression and pseudorandom generators., , and . Computational Complexity, 14 (3): 228-255 (2005)Holographic Proofs and Derandmization., and . SIAM J. Comput., 35 (1): 59-90 (2005)Separating Complexity Classes Using Autoreducibility., , , and . SIAM J. Comput., 29 (5): 1497-1520 (2000)Locality from Circuit Lower Bounds., , , and . SIAM J. Comput., 41 (6): 1481-1523 (2012)Time-Space Efficient Simulations of Quantum Computations., and . Electronic Colloquium on Computational Complexity (ECCC), (2010)Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses., and . Electronic Colloquium on Computational Complexity (ECCC), (1998)Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses., and . SIAM J. Comput., 31 (5): 1501-1526 (2002)Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines., and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 982-993. Springer, (2005)Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines., and . Complexity of Boolean Functions, volume 06111 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)