CNF Satisfiability in a Subspace and Related Problems.
Vikraman ArvindVenkatesan GuruswamiPublished in: IPEC (2021)
Keyphrases
- related problems
- cnf formula
- conjunctive normal form
- sat solving
- satisfiability problem
- sat problem
- boolean formula
- np complete
- sat instances
- low dimensional
- boolean functions
- range searching
- linear subspace
- high dimensional
- sat solvers
- subspace clustering
- dimensionality reduction
- propositional satisfiability
- broadly applicable
- clause learning
- high dimensional data
- knowledge compilation
- sat encodings
- feature space
- max sat
- subspace learning
- propositional logic
- phase transition
- computational complexity
- stochastic local search
- polynomial size
- principal component analysis
- subspace methods
- propositional formulas
- multi dimensional
- terminological reasoning
- orders of magnitude
- stable marriage
- satisfiability testing