Michael Alekhnovich, Sam Buss, Shlomo Moran, and Toniann Pitassi. Minimum propositional proof length is NP-hard to linearly approximate. The journal of symbolic logic, vol. 66 (2001), pp. 171–191.

Alexander Razborov
  • Bulletin of Symbolic Logic, June 2002, Cambridge University Press
  • DOI: 10.2178/bsl/1182353876

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.2178/bsl/1182353876

The following have contributed to this page: Samuel R Buss