Ludwig-Maximilians-Universität München, Germany
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| 4 |      | Jan Hoffmann: Finding a tree structure in a resolution proof is NP-complete. Theor. Comput. Sci. 410(21-23): 2295-2300 (2009) |
| 2008 | ||
| 3 | | Samuel R. Buss, Jan Hoffmann, Jan Johannsen: Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning CoRR abs/0811.1075: (2008) |
| 2 | | Samuel R. Buss, Jan Hoffmann, Jan Johannsen: Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning. Logical Methods in Computer Science 4(4): (2008) |
| 1 | | Samuel R. Buss, Jan Hoffmann: The NP-hardness of finding a directed acyclic graph for regular resolution. Theor. Comput. Sci. 396(1-3): 271-276 (2008) |
| 1 | Samuel R. Buss | [1] [2] [3] |
| 2 | Jan Johannsen | [2] [3] |