( en | de | ru )

 

Disambiguation of "van Melkebeek, Dieter"

Author of the publication

copydeleteadd this publication to your clipboard
A Survey of Lower Bounds for Satisfiability and Related Problems.

. Electron. Colloquium Comput. Complex., (2007)

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.

Dieter Melkebeek

Dieter van Leyen

Dieter van Leyen

Huynh Van Van

Staffan Lars Mikael Vandersee

 

Other publications of authors with the same name

A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract)., , , , and . STACS, volume 1373 of Lecture Notes in Computer Science, page 161-171. Springer, (1998)Special Issue "Conference on Computational Complexity 2010" Guest Editor's Foreword.. Comput. Complex., 20 (2): 173-175 (2011)Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011)., , , , and . SIAM J. Comput., 41 (5): 1233-1234 (2012)A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem, , , , and . Electron. Colloquium Comput. Complex., (1998)Minimum Circuit Size, Graph Isomorphism, and Related Problems., , , , and . Electron. Colloquium Comput. Complex., (2017)Hard Sets Are Hard to Find., and . J. Comput. Syst. Sci., 59 (2): 327-345 (1999)Space Hierarchy Results for Randomized Models., and . STACS, volume 1 of LIPIcs, page 433-444. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)Hard Sets are Hard to Find., and . CCC, page 170-181. IEEE Computer Society, (1998)Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games., and . CCC, page 269-279. IEEE Computer Society, (2012)Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses., and . SIAM J. Comput., 31 (5): 1501-1526 (2002)