Pages that link to "Item:Q786033"
From MaRDI portal
The following pages link to Best-case and worst-case sparsifiability of Boolean CSPs (Q786033):
Displaying 9 items.
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials (Q4608634) (← links)
- (Q5009477) (← links)
- Sparsification of Binary CSPs (Q5090464) (← links)
- Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials (Q5205824) (← links)
- (Q5874535) (← links)
- (Q6065467) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
- Algebraic global gadgetry for surjective constraint satisfaction (Q6581872) (← links)