 | 2010 |
|---|
| 8 |       | Philipp Hertel,
Toniann Pitassi:
The PSPACE-Completeness of Black-White Pebbling.
SIAM J. Comput. 39(6): 2622-2682 (2010) |
| 2008 |
|---|
| 7 |  | Philipp Hertel,
Fahiem Bacchus,
Toniann Pitassi,
Allen Van Gelder:
Clause Learning Can Effectively P-Simulate General Propositional Resolution.
AAAI 2008: 283-290 |
| 2007 |
|---|
| 6 | | Philipp Hertel,
Toniann Pitassi:
Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling.
FOCS 2007: 137-149 |
| 5 | | Alexander Hertel,
Philipp Hertel,
Alasdair Urquhart:
Formalizing Dangerous SAT Encodings.
SAT 2007: 159-172 |
| 4 | | Philipp Hertel,
Toniann Pitassi:
Black-White Pebbling is PSPACE-Complete.
Electronic Colloquium on Computational Complexity (ECCC) 14(044): (2007) |
| 3 | | Philipp Hertel,
Toniann Pitassi:
An Exponential Time/Space Speedup For Resolution.
Electronic Colloquium on Computational Complexity (ECCC) 14(046): (2007) |
| 2 | | Alexander Hertel,
Philipp Hertel,
Charles Morgan:
A Sound and Complete Proof Theory for Propositional Logical Contingencies.
Notre Dame Journal of Formal Logic 48(4): 521-530 (2007) |
| 2002 |
|---|
| 1 | | Ulrike Stege,
Iris van Rooij,
Alexander Hertel,
Philipp Hertel:
An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover.
ISAAC 2002: 249-261 |
Data released under the ODC-BY 1.0 license — See also our legal information page