( en | de | ru )

 

Disambiguation of "Hertel, Philipp"

Author of the publication

copydeleteadd this publication to your clipboard
An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover.

, , , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 249-261. Springer, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gernot Hertel

Christian Hertel

Fritz Hertel

Günther Hertel

Dieter Hertel

 

Other publications of authors with the same name

An Exponential Time/Space Speedup For Resolution., and . Electron. Colloquium Comput. Complex., (2007)Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling., and . FOCS, page 137-149. IEEE Computer Society, (2007)Clause Learning Can Effectively P-Simulate General Propositional Resolution., , , and . AAAI, page 283-290. AAAI Press, (2008)An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover., , , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 249-261. Springer, (2002)The PSPACE-Completeness of Black-White Pebbling., and . SIAM J. Comput., 39 (6): 2622-2682 (2010)Black-White Pebbling is PSPACE-Complete., and . Electron. Colloquium Comput. Complex., (2007)Clause Learning, Resolution Space, and Pebbling.. University of Toronto, Canada, (2009)Formalizing Dangerous SAT Encodings., , and . SAT, volume 4501 of Lecture Notes in Computer Science, page 159-172. Springer, (2007)A Sound and Complete Proof Theory for Propositional Logical Contingencies., , and . Notre Dame J. Formal Log., 48 (4): 521-530 (2007)