Minimum Propositional Proof Length is NP-Hard to Linearly Approximate.
Michael AlekhnovichSamuel R. BussShlomo MoranToniann PitassiPublished in: MFCS (1998)
Keyphrases
- np hard
- minimum cost
- approximate solutions
- propositional logic
- approximation algorithms
- np complete
- scheduling problem
- optimal solution
- special case
- lower bound
- worst case
- linear programming
- constraint satisfaction problems
- closely related
- theorem prover
- minimum length
- first order logic
- branch and bound algorithm
- min sum
- theorem proving
- computational complexity
- classical first order logic
- remains np hard
- search algorithm
- np hardness
- multi valued
- integer programming
- satisfiability testing
- search space