Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate

Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi. Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. Journal of Symbolic Logic, 66(1):171-191, 2001.

Abstract

Abstract is missing.