Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof.
Karthik C. S.Dániel MarxMarcin PilipczukUéverton S. SouzaPublished in: CoRR (2023)
Keyphrases
- lower bound
- upper bound
- constraint satisfaction problems
- random instances
- np hard
- branch and bound algorithm
- optimal solution
- decomposition methods
- sparse representation
- upper and lower bounds
- worst case
- branch and bound
- constraint satisfaction
- objective function
- sparse data
- constraint propagation
- high dimensional
- vc dimension
- arc consistency
- tree decomposition
- random field model
- finding optimal solutions
- linear programming relaxation
- np complete
- optimal cost
- high speed train