We prove that the problem of determining the minimum propositional proof length is NP- hard to approximate within a factor of 2 log1 - o (1)n. These results are very robust in that they hold for ...