The NP-hardness of finding a directed acyclic graph for regular resolution

Samuel R. Buss, Jan Hoffmann
  • Theoretical Computer Science, May 2008, Elsevier
  • DOI: 10.1016/j.tcs.2008.01.039

The authors haven't finished explaining this publication. If you are the author, sign in to claim or explain your work.

Read Publication

The following have contributed to this page: Samuel R Buss