Pages that link to "Item:Q5053064"
From MaRDI portal
The following pages link to Sparsification of SAT and CSP Problems via Tractable Extensions (Q5053064):
Displaying 8 items.
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889) (← links)
- (Q5863854) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
- Algebraic global gadgetry for surjective constraint satisfaction (Q6581872) (← links)