Minimum propositional proof length is NP-hard to linearly approximate

Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi
  • Journal of Symbolic Logic, March 2001, Cambridge University Press
  • DOI: 10.2307/2694916

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

Read Publication

http://dx.doi.org/10.2307/2694916

The following have contributed to this page: Samuel R Buss