Pages that link to "Item:Q4608634"
From MaRDI portal
The following pages link to Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials (Q4608634):
Displaying 10 items.
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (Q2875151) (← links)
- (Q5009477) (← links)
- Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (Q5111881) (← links)
- Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials (Q5205824) (← links)
- Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT (Q5363770) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- (Q5863854) (← links)