The following pages link to (Q5687264):
Displaying 11 items.
- Generating new test instances by evolving in instance space (Q342041) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
- On conversions from CNF to ANF (Q2307626) (← links)
- The complexity of generating test instances (Q5048939) (← links)
- Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden (Q5881807) (← links)
- Approximation of coNP sets by NP-complete sets (Q6064009) (← links)