Approximation Resistance on Satisfiable Instances for Sparse Predicates.
Sangxia HuangPublished in: Theory Comput. (2014)
Keyphrases
- randomly generated
- sat instances
- random instances
- phase transition
- sparse representation
- sparse approximation
- user defined
- satisfiability problem
- training instances
- approximation error
- closed form
- approximation algorithms
- queueing networks
- special case
- approximation methods
- sparse data
- sparse approximations
- compressive sensing
- sat problem
- error bounds
- np complete
- genetic algorithm
- sat solvers
- propositional satisfiability
- sparse matrix
- active learning