The following pages link to (Q5715725):
Displayed 10 items.
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Average-case analysis for the MAX-2SAT problem (Q964385) (← links)
- Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939) (← links)
- Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length (Q2111656) (← links)
- Solving non-uniform planted and filtered random SAT formulas greedily (Q2118298) (← links)
- Optimal testing for planted satisfiability problems (Q2259537) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (Q3502713) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden (Q5881807) (← links)