D. Melkebeek

发表

Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses

Dieter van Melkebeek, Adam R. Klivans, D. Melkebeek, 2002, SIAM J. Comput..

Survey of Satisfiability Algorithms

S. Ravi, D. Melkebeek, 2012 .

TIME-SPACE LOWER BOUNDS FOR NP-COMPLETE PROBLEMS

D. Melkebeek, 2004 .

MINIMUM CIRCUIT SIZE , GRAPH ISOMORPHISM , AND RELATED

Joshua A. Grochow, C. Moore, D. Melkebeek, 2018 .

C C ] 2 6 O ct 2 01 7 Minimum Circuit Size , Graph Isomorphism , and Related Problems ∗

Joshua A. Grochow, E. Allender, C. Moore, 2018 .

Time-space lower bounds for satisfiability and related problems on randomized machines

D. Melkebeek, Scott Diehl, 2008 .

Lecture 10: Expander Constructions

D. Melkebeek, Holger Dell, Xi Wu, 2013 .

Advancing algebraic and logical approaches to circuit lower bounds

D. Melkebeek, Matthew W. Anderson, 2012 .

Block orthogonal systems for symmetric P -forms

D. Melkebeek, A. Bultheel, 1993 .

Proceedings of the Annual IEEE Conference on Computational Complexity: Preface

Peter Bro Miltersen, Ronitt Rubinfeld, Luca Trevisan, 2005 .

The Power of Randomness in Computing

D. Melkebeek, Gautam Prakriya, 2013 .

Query Complexity of Inversion Minimization on Trees

D. Melkebeek, Ivan Hu, Andrew Morgan, 2022, ArXiv.

Honors Thesis A Bound on the Maximum Coefficient of Gaussian Polynomials

D. Melkebeek, 2022 .

Complexity of Boolean Functions, 12.03. - 17.03.2006

Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk, 2006, Complexity of Boolean Functions.

The Quantum Black-Box Complexity of Majority

Thomas P. Hayes, S. Kutin, D. Melkebeek, 2001, Algorithmica.

Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses

Dieter van Melkebeek, Holger Dell, D. Melkebeek, 2014, JACM.

Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games

Dieter van Melkebeek, Baris Aydinlioglu, D. Melkebeek, 2012, 2012 IEEE 27th Conference on Computational Complexity.

Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds

Dieter van Melkebeek, Ronen Shaltiel, Jeff Kinne, 2011, computational complexity.

Space Hierarchy Results for Randomized and other Semantic Models

Dieter van Melkebeek, Jeff Kinne, D. Melkebeek, 2010, computational complexity.

Language compression and pseudorandom generators

Troy Lee, Harry Buhrman, Dieter van Melkebeek, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

Derandomizing Isolation in Space-Bounded Settings

Dieter van Melkebeek, Gautam Prakriya, D. Melkebeek, 2017, CCC.

Time-space lower bounds for satisfiability

Richard J. Lipton, Lance Fortnow, Dieter van Melkebeek, 2005, JACM.

Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets

Dieter van Melkebeek, D. Melkebeek, 1998, J. Comput. Syst. Sci..

Sparse Hard Sets for P

Dieter van Melkebeek, Mitsunori Ogihara, M. Ogihara, 1997, Advances in Algorithms, Languages, and Complexity.

A note on Graph Automorphism and Smart Reductions

Joshua A. Grochow, E. Allender, C. Moore, 2018 .

Time-Space Efficient Simulations of Quantum Computations

Dieter van Melkebeek, Thomas Watson, D. Melkebeek, 2012, Theory Comput..

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

Dieter van Melkebeek, Scott Diehl, D. Melkebeek, 2005, SIAM J. Comput..

Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses

Dieter van Melkebeek, Holger Dell, D. Melkebeek, 2010, STOC '10.

Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses

Dieter van Melkebeek, Adam R. Klivans, D. Melkebeek, 1999, STOC '99.

A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem

Dieter van Melkebeek, Kenneth W. Regan, Harry Buhrman, 2000, SIAM J. Comput..

A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract)

Dieter van Melkebeek, D. Sivakumar, Kenneth W. Regan, 1998, STACS.

Power from random strings

Eric Allender, Dieter van Melkebeek, Harry Buhrman, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

A Survey of Lower Bounds for Satisfiability and Related Problems

Dieter van Melkebeek, D. Melkebeek, 2007, Found. Trends Theor. Comput. Sci..

A time lower bound for satisfiability

Ran Raz, Dieter van Melkebeek, D. Melkebeek, 2004, Theor. Comput. Sci..

Deterministic polynomial identity tests for multilinear bounded-read formulae

Ilya Volkovich, Dieter van Melkebeek, Matthew Anderson, 2015, computational complexity.

Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae

Ilya Volkovich, Dieter van Melkebeek, Matthew Anderson, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

Invariant finite Borel measures for rational functions on the Riemann sphere

D. Melkebeek, A. Bultheel, 1994 .

Optimal Proof Systems and Sparse Sets

Lance Fortnow, Dieter van Melkebeek, Harry Buhrman, 2000, STACS.

Pseudorandom Generators and Typically-Correct Derandomization

Dieter van Melkebeek, Ronen Shaltiel, Jeff Kinne, 2009, APPROX-RANDOM.

Instance-Wise Hardness versus Randomness Tradeoffs for Arthur-Merlin Protocols

Nicollas M. Sdroievski, D. Melkebeek, 2023, Electron. Colloquium Comput. Complex..