Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof.
Karthik C. S.Dániel MarxMarcin PilipczukUéverton S. SouzaPublished in: SOSA (2024)
Keyphrases
- lower bound
- upper bound
- constraint satisfaction problems
- np hard
- branch and bound algorithm
- constraint satisfaction
- branch and bound
- random instances
- finding optimal solutions
- objective function
- constraint programming
- random field model
- theorem prover
- worst case
- tree decomposition
- decomposition methods
- upper and lower bounds
- lower and upper bounds
- optimal solution
- arc consistency
- theorem proving
- tree decompositions
- high dimensional
- constraint propagation
- conditional logic
- quadratic assignment problem
- sparse data
- sparse representation
- vc dimension
- constraint networks
- np complete
- high speed train