"Finding a tree structure in a resolution proof is NP-complete."

Jan Hoffmann (2009)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2009.02.018

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Hoffmann09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Hoffmann09
Jan Hoffmann:
Finding a tree structure in a resolution proof is NP-complete. Theor. Comput. Sci. 410(21-23): 2295-2300 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.