Pages that link to "Item:Q5363770"
From MaRDI portal
The following pages link to Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT (Q5363770):
Displaying 8 items.
- Paths to trees and cacti (Q1998842) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← 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)
- Sparsification of SAT and CSP Problems via Tractable Extensions (Q5053064) (← links)
- Triangle packing in (sparse) tournaments: approximation and kernelization (Q5111699) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)