Philipp Hertel

According to our database, Philipp Hertel authored at least 9 papers between 2002 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

The PSPACE-Completeness of Black-White Pebbling.

Philipp Hertel, Toniann Pitassi

SIAM J. Comput., 2010

2009

Clause Learning, Resolution Space, and Pebbling.

Philipp Hertel

PhD thesis, 2009

2008

Clause Learning Can Effectively P-Simulate General Propositional Resolution.

Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

A Sound and Complete Proof Theory for Propositional Logical Contingencies.

Alexander Hertel, Philipp Hertel, Charles Morgan

Notre Dame J. Formal Log., 2007

An Exponential Time/Space Speedup For Resolution.

Philipp Hertel, Toniann Pitassi

Electron. Colloquium Comput. Complex., 2007

Black-White Pebbling is PSPACE-Complete.

Philipp Hertel, Toniann Pitassi

Electron. Colloquium Comput. Complex., 2007

Formalizing Dangerous SAT Encodings.

Alexander Hertel, Philipp Hertel, Alasdair Urquhart

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling.

Philipp Hertel, Toniann Pitassi

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2002

An O(pn + 1.151^p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover.

Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002