Pages that link to "Item:Q4351797"
From MaRDI portal
The following pages link to SAT-Problems and Reductions with Respect to the Number of Variables (Q4351797):
Displayed 5 items.
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- Parameterized random complexity (Q1946497) (← links)
- The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410) (← links)
- k-SAT Is No Harder Than Decision-Unique-k-SAT (Q3392942) (← links)
- Lower Bounds for Kernelizations and Other Preprocessing Procedures (Q3576044) (← links)
