Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have ...
This is a preview. Log in through your library . Abstract We prove that the problem of determining the minimum propositional proof length is NP- hard to approximate within a factor of 2 log 1 - o(1) n ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback