CNF Satisfiability in a Subspace and Related Problems.
Vikraman ArvindVenkatesan GuruswamiPublished in: Electron. Colloquium Comput. Complex. (2021)
Keyphrases
- related problems
- cnf formula
- conjunctive normal form
- sat solving
- satisfiability problem
- np complete
- boolean formula
- sat problem
- sat instances
- low dimensional
- satisfiability testing
- stochastic local search
- model counting
- broadly applicable
- boolean functions
- high dimensional
- subspace clustering
- sat solvers
- linear subspace
- feature space
- principal component analysis
- subspace learning
- range searching
- stable marriage
- clause learning
- dimensionality reduction
- propositional satisfiability
- propositional formulas
- propositional logic
- subspace clusters
- sat encodings
- max sat
- computational complexity
- knowledge compilation
- practical problems
- lower dimensional
- feature extraction
- subspace methods
- unit propagation
- randomly generated
- high dimensional data
- data points
- terminological reasoning