63 citations · 252 across the 39 of their papers we have counts for
4 papers · 1 filter
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples
Curtis Bright, Dragomir Z. Djokovic, Ilias Kotsireas +1
We enumerate all circulant good matrices with odd orders divisible by 3 up to order 70. As a consequence of this we find a previously overlooked set of good matrices of order 27 an…
Enumeration of Complex Golay Pairs via Programmatic SAT
Curtis Bright, Ilias Kotsireas, Albert Heinle +1
We provide a complete enumeration of all complex Golay pairs of length up to 25, verifying that complex Golay pairs do not exist in lengths 23 and 25 but do exist in length 24. Thi…
Applying Computer Algebra Systems with SAT Solvers to the Williamson Conjecture
Curtis Bright, Ilias Kotsireas, Vijay Ganesh
We employ tools from the fields of symbolic computation and satisfiability checking---namely, computer algebra systems and SAT solvers---to study the Williamson conjecture from com…
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability
Joel Day, Vijay Ganesh, Paul He +2
The study of word equations (or the existential theory of equations over free monoids) is a central topic in mathematics and theoretical computer science. The problem of deciding w…