Login / Signup

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

Jan Hoffmann
Published in: Theor. Comput. Sci. (2009)
Keyphrases