Searching for authors named "Dieter van Melkebeek" – sorted by Relevance.
-
On the Measure of BBP
- On the Measure of BPP Dieter van Melkebeek Fields Institute & The University of Chicago June 5
- Add To MetaCart
-
Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L
- Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L Dieter van Melkebeek
- Cited by 5 (1 self) – Add To MetaCart
-
Derandomizing Arthur-Merlin Games
- Derandomizing Arthur-Merlin Games Dieter van Melkebeek The University of Chicago July 14, 1998
- Cited by 2 (1 self) – Add To MetaCart
-
On Reductions of P Sets to Sparse Sets
- On Reductions of P Sets to Sparse Sets Dieter van Melkebeek The University of Chicago June 18
- Cited by 3 (0 self) – Add To MetaCart
-
Deterministic and Randomized Bounded Truth-table Reductions of P, NL, and L to Sparse Sets
- van Melkebeek Department of Computer Science The University of Chicago Chicago, IL 60637 Abstract
- Cited by 2 (0 self) – Add To MetaCart
-
Time-Space Lower Bounds for Satisfiability
- Time-Space Lower Bounds for Satisfiability Dieter van Melkebeek Institute for Advanced Study
- Cited by 1 (1 self) – Add To MetaCart
-
The zero-one law holds for BPP
- The Zero-One Law Holds for BPP Dieter van Melkebeek* DIMACS Rutgers University 96 Frelinghuysen
- Cited by 6 (0 self) – Add To MetaCart
-
Sparse Hard Sets for P
- DIMACS Technical Report 96-40 September 1996 Sparse Hard Sets for P by Dieter van Melkebeek 1
- Cited by 1 (0 self) – Add To MetaCart
-
A time lower bound for satisfiability
- A Time Lower Bound for Satisfiability Dieter van Melkebeek?1 and Ran Raz2 1 University
- Cited by 5 (0 self) – Add To MetaCart
-
Melkebeek D. Graph isomorphism for colored graphs with color multiplicity bounded by 3
- ���Graph Isomorphism for Colored Graphs with Color Multiplicity Bounded by 3 Akash Lal and Dieter van
- Cited by 1 (0 self) – Add To MetaCart

