Pages that link to "Item:Q5205824"
From MaRDI portal
The following pages link to Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials (Q5205824):
Displaying 12 items.
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← 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)
- Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials (Q4608634) (← links)
- Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
- (Q5009477) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← 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)
- (Q5874535) (← links)
- Algebraic global gadgetry for surjective constraint satisfaction (Q6581872) (← links)