Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate

Alexander Razborov, Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi
  • Bulletin of Symbolic Logic, June 2002, Cambridge University Press
  • DOI: 10.2307/2693969

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/2693969

The following have contributed to this page: Samuel R Buss