Pages that link to "Item:Q5111881"
From MaRDI portal
The following pages link to Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (Q5111881):
Displaying 5 items.
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- (Q5009477) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
- (Q6065467) (← links)
