Pages that link to "Item:Q2674189"
From MaRDI portal
The following pages link to Critical behavior in the computational cost of satisfiability testing (Q2674189):
Displaying 9 items.
- Generic properties of a computational task predict human effort and performance (Q825138) (← links)
- The TSP phase transition (Q1391912) (← links)
- Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT (Q1777400) (← links)
- Solving non-uniform planted and filtered random SAT formulas greedily (Q2118298) (← links)
- Generating hard satisfiability problems (Q2674174) (← links)
- Some pitfalls for experimenters with random SAT (Q2674180) (← links)
- Implicates and prime implicates in random 3-SAT (Q2674186) (← links)
- Algorithm portfolios (Q5940819) (← links)
- Biased random <i>k</i>‐SAT (Q6074657) (← links)
