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.
Myrvold, Negative results for orthogonal triples of Latin squares of or- der 10, Journal of Combinatorial Mathematics and Combinatorial Computing 29 (1999) 95–105
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.