Dieter van Melkebeek
- Alumnus
- Department of Computer Science
Contact Information
University of Chicago
1100 E 58th Street
Chicago, IL 60637
Office:
Phone: (773)702-6614
Fax: (773)702-8487
dieter@cs.uchicago.edu
Personal Homepage
http://people.cs.uchicago.edu/~dieter
Technical Reports
- TR-99-04
- Randomness and Completeness in Computational Complexity. Van Melkebeek, Dieter. 21 May, 1999.
- TR-98-12
- Graph NonIsomorphism has Subexponential Size Proofs unless the Polynomial-Time Hierarchy Collapses. Van Melkebeek, Dieter; Klivans, Adam. 11 December, 1998.
- TR-98-11
- On the Quantum Complexity of Majority. Hayes, Thomas; Kutin, Samuel; Van Melkebeek, Dieter. 11 December, 1998.
- TR-98-08
- Derandomizing Arthur-Merlin Games. Van Melkebeek, Dieter. 14 July, 1998.
- TR-98-07
- On the Measure of BPP. Van Melkebeek, Dieter. 5 June, 1998.
- TR-97-16
- Hard Sets are Hard to Find. Van Melkebeek, Dieter; Buhrman, Harry. 28 December, 1997.
- TR-97-04
- Complete Sets under Non-Adaptive Reductions are Scarce. Van Melkebeek, Dieter; Buhrman, Harry. 12 May, 1997.
