| 2007 |
|---|
| 4 | EE | Scott Diehl:
Lower Bounds for Swapping Arthur and Merlin.
APPROX-RANDOM 2007: 449-463 |
| 2006 |
|---|
| 3 | EE | Scott Diehl,
Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines.
Complexity of Boolean Functions 2006 |
| 2 | EE | Scott Diehl,
Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines.
SIAM J. Comput. 36(3): 563-594 (2006) |
| 2005 |
|---|
| 1 | EE | Scott Diehl,
Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines.
ICALP 2005: 982-993 |
