According to our database1, Curtis Bright authored at least 18 papers between 2011 and 2020.
Legend:Book In proceedings Article PhD thesis Other
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten.
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem.
A Nonexistence Certificate for Projective Planes of Order Ten with Weight 15 Codewords.
Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT.
SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics.
Effective problem solving using SAT solvers.
New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences.
The SAT+CAS method for combinatorial search with applications to best matrices.
Ann. Math. Artif. Intell., 2019
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture.
The SAT+CAS paradigm and the Williamson conjecture.
ACM Comm. Computer Algebra, 2018
Enumeration of Complex Golay Pairs via Programmatic SAT.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
A SAT+CAS Method for Enumerating Williamson Matrices of Even Order.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018
Computational Methods for Combinatorial and Number Theoretic Problems.
PhD thesis, 2017
Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures.
J. Autom. Reasoning, 2017
Minimal Elements for the Prime Numbers.
Experimental Mathematics, 2016
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures.
Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation co-located with 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016), 2016
Vector rational number reconstruction.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011