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.
Euler, Recherches sur une nouvelle espèce de quarrés magiques, Verhandelingen uitgegeven door het zeeuwsch Genootschap der Wetenschappen te Vlissingen (1782) 85–239
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.