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):
Displaying 10 items.
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- SAT problems with chains of dependent variables (Q1408386) (← links)
- Local reduction (Q1641001) (← links)
- Parameterized random complexity (Q1946497) (← links)
- The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410) (← links)
- Reducing symmetries to generate easier SAT instances (Q2848064) (← links)
- (Q3011193) (← links)
- k-SAT Is No Harder Than Decision-Unique-k-SAT (Q3392942) (← links)
- Lower Bounds for Kernelizations and Other Preprocessing Procedures (Q3576044) (← links)
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (Q3637160) (← links)