Approximation resistance on satisfiable instances for predicates with few accepting inputs.
Sangxia HuangPublished in: STOC (2013)
Keyphrases
- randomly generated
- sat instances
- random instances
- phase transition
- closed form
- approximation error
- error bounds
- np complete
- satisfiability problem
- approximation methods
- propositional formulas
- training instances
- sat solvers
- approximation schemes
- queueing networks
- search algorithm
- approximation algorithms
- user defined
- natural language processing