Augmenting SAT solvers with the Euler-Parker algorithm solves hard 10x10 orthogonal Latin square problems in a median of 5100 seconds instead of failing after seven days.
Wernicke, Das problem der 36 offiziere, Jahresbericht der Deutschen Mathematiker-Vereinigung 19 (1910) 264–267
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improving SAT Solvers on Orthogonal Latin Square Problems
Augmenting SAT solvers with the Euler-Parker algorithm solves hard 10x10 orthogonal Latin square problems in a median of 5100 seconds instead of failing after seven days.