The following pages link to (Q3624048):
Displaying 7 items.
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length (Q2111656) (← links)
- Optimal testing for planted satisfiability problems (Q2259537) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
- Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden (Q5881807) (← links)
- Generating Difficult CNF Instances in Unexplored Constrainedness Regions (Q6039929) (← links)