On Approximation Hardness of the Minimum 2SAT-DELETION Problem.
Miroslav ChlebíkJanka ChlebíkováPublished in: MFCS (2004)
Keyphrases
- phase transition
- satisfiability problem
- np complete
- constant factor
- closed form
- sat solvers
- error bounds
- approximation algorithms
- search algorithm
- worst case
- approximation methods
- sat problem
- minimum cost
- approximation error
- propositional satisfiability
- np hard
- neural network
- relative error
- boolean satisfiability
- queueing networks
- randomly generated
- constraint satisfaction
- constraint satisfaction problems
- computational complexity
- learning algorithm