Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction.
Marvin KünnemannDániel MarxPublished in: Computational Complexity Conference (2020)
Keyphrases
- fine grained
- constraint satisfaction
- brute force
- coarse grained
- constraint satisfaction problems
- computationally expensive
- constraint programming
- access control
- heuristic search
- constraint propagation
- constraint relaxation
- constraint networks
- robust fault detection
- exhaustive search
- computer chess
- constraint solving
- co occurrence
- soft constraints
- product configuration
- constraint optimization
- arc consistency
- lower bound
- boolean functions
- constrained problems
- dynamic programming
- max csp
- search space