|
-
Clause Learning can Effectively P-Simulate General Propositional Resolution, F. Bacchus, P. Hertel, T. Pitassi, and Allen Van Gelder, submitted AAAI 2008.
-
Black White Pebbling is PSPACE-Complete, P. Hertel, and T. Pitassi, submitted FOCS 2007.
-
An Exponential Time / Space Speedup For Resolution, P. Hertel, and T. Pitassi, submitted FOCS 2007.
-
Formalizing Dangerous SAT Encodings, A. Hertel, P. Hertel, and A. Urquhart, SAT 2007 Lisbon Portugal. Presentation
-
A Sound and Complete Proof Theory for Propositional Logical Contingencies, C. Morgan, A. Hertel, and P. Hertel, To appear in Notre Dame Journal of Formal Logic (accepted 2006).
-
An O(pn+1.151p)-Algorithm for p-Profit Cover and its Practical Implications for Vertex Cover, U. Stege, I. van Rooij, A. Hertel, and P. Hertel, ISAAC 2002.
|