The following pages link to (Q3624064):
Displaying 11 items.
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains (Q328683) (← links)
- A general model and thresholds for random constraint satisfaction problems (Q359981) (← links)
- A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming (Q507445) (← links)
- On the phase transitions of random \(k\)-constraint satisfaction problems (Q543632) (← links)
- 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)
- Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP (Q2164572) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- Super Solutions of Random Instances of Satisfiability (Q3452579) (← links)
- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (Q3502697) (← links)
- Fractional Edge Cover Number of Model RB (Q4632176) (← links)
