| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) | Grohe, Martin et al. | 2011 |
| 2 | Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses | Dell, Holger et al. | 2010 |
| 3 | 08381 Abstracts Collection -- Computational Complexity of Discrete Problems | Miltersen, Peter Bro et al. | 2008 |
| 4 | 08381 Executive Summary -- Computational Complexity of Discrete Problems | Miltersen, Peter Bro et al. | 2008 |
| 5 | Space Hierarchy Results for Randomized Models | Kinne, Jeff et al. | 2008 |
| 6 | 06111 Abstracts Collection -- Complexity of Boolean Functions | Krause, Matthias et al. | 2006 |
| 7 | 06111 Executive Summary -- Complexity of Boolean Functions | Krause, Matthias et al. | 2006 |
| 8 | A Generic Time Hierarchy for Semantic Models With One Bit of Advice | van Melkebeek, Dieter et al. | 2006 |
| 9 | Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines | Diehl, Scott et al. | 2006 |
| Number of result pages: | 1 |
| Number of documents: | 9 |
