The following pages link to (Q4203815):
Displaying 10 items.
- Exploiting functional dependencies in declarative problem specifications (Q1028967) (← links)
- An easy counting lemma (Q1730233) (← links)
- Backtrack search with isomorph rejection and consistency check (Q1825676) (← links)
- Faster backtracking algorithms for the generation of symmetry-invariant permutations (Q1854122) (← links)
- Accelerating backtrack search with a best-first-search strategy (Q2018417) (← links)
- FSM inference from long traces (Q2024336) (← links)
- Perfect refiners for permutation group backtracking algorithms (Q2156355) (← links)
- Duality in permutation state spaces and the dual search algorithm (Q2389626) (← links)
- Automated reformulation of specifications by safe delay of constraints (Q2457622) (← links)
- Exploiting symmetries within constraint satisfaction search (Q5941314) (← links)
