 | 2009 |
|---|
| 7 |       | Alexander Hertel,
Alasdair Urquhart:
Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete.
Electronic Colloquium on Computational Complexity (ECCC) 16: 3 (2009) |
| 6 | | Alexander Hertel,
Alasdair Urquhart:
Algorithms and Complexity Results for Input and Unit Resolution.
JSAT 6(1-3): 141-164 (2009) |
| 2007 |
|---|
| 5 | | Alexander Hertel,
Alasdair Urquhart:
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space.
CSL 2007: 527-541 |
| 4 | | Alexander Hertel,
Philipp Hertel,
Alasdair Urquhart:
Formalizing Dangerous SAT Encodings.
SAT 2007: 159-172 |
| 3 | | 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) |
| 2006 |
|---|
| 2 | | Alexander Hertel,
Alasdair Urquhart:
The Resolution Width Problem is EXPTIME-Complete.
Electronic Colloquium on Computational Complexity (ECCC) 13(133): (2006) |
| 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