Investigating the Existence of Holey Latin Squares via Satisfiability Testing
- 10 November 2023
- book chapter
- Published by Springer Nature
- p. 410-422
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Design of strong cryptographic schemes based on Latin SquaresJournal of Discrete Mathematical Sciences and Cryptography, 2010
- Z3: An Efficient SMT Solver2008
- Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of EncodingsJournal of Automated Reasoning, 2006
- Reducing Symmetries to Generate Easier SAT InstancesElectronic Notes in Theoretical Computer Science, 2005
- Automated reasoning and exhaustive search: Quasigroup existence problemsComputers & Mathematics with Applications, 1995
- The spectra of a variety of quasigroups and related combinatorial designsDiscrete Mathematics, 1989
- The complexity of completing partial Latin squaresDiscrete Applied Mathematics, 1984
- Steiner pentagon systemsDiscrete Mathematics, 1984
- Computer investigation of orthogonal Latin squares of order ten1963
- The latin square principle in the design and analysis of psychological experiments.Psychological Bulletin, 1948