Publications

Search
Author Title Type [ Year(Desc)]
2011
C. Bright and Storjohann, A. , “Vector rational number reconstruction”, in Symbolic and Algebraic Computation, International Symposium, ISSAC 2011 (co-located with FCRC 2011), San Jose, CA, USA, June 7-11, 2011, Proceedings, 2011, pp. 51–58.
2016
C. Bright, Ganesh, V. , Heinle, A. , Kotsireas, I. S. , Nejati, S. , and Czarnecki, K. , “MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures”, in 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), Timisoara, Romania, September 24, 2016, 2016, vol. 1804, pp. 13–19.
C. Bright, Ganesh, V. , Heinle, A. , Kotsireas, I. S. , Nejati, S. , and Czarnecki, K. , “MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures”, in Computer Algebra in Scientific Computing - 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings, 2016, vol. 9890, pp. 117–133.
C. Bright, Devillers, R. R. , and Shallit, J. O. , “Minimal Elements for the Prime Numbers”, Exp. Math., vol. 25, pp. 321–331, 2016.
2017
E. Zulkoski, Bright, C. , Heinle, A. , Kotsireas, I. S. , Czarnecki, K. , and Ganesh, V. , “Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures”, J. Autom. Reason., vol. 58, pp. 313–339, 2017.
C. Bright, “Computational Methods for Combinatorial and Number Theoretic Problems”, University of Waterloo, Ontario, Canada, 2017.
2018
C. Bright, Kotsireas, I. S. , Heinle, A. , and Ganesh, V. , “Enumeration of Complex Golay Pairs via Programmatic SAT”, in Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018, 2018, pp. 111–118.
C. Bright, Kotsireas, I. S. , and Ganesh, V. , “A SAT+CAS Method for Enumerating Williamson Matrices of Even Order”, in Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orl, 2018, pp. 6573–6580.
C. Bright, Kotsireas, I. S. , and Ganesh, V. , “The SAT+CAS paradigm and the Williamson conjecture”, ACM Commun. Comput. Algebra, vol. 52, pp. 82–84, 2018.
2019
C. Bright, Gerhard, J. , Kotsireas, I. S. , and Ganesh, V. , “Effective Problem Solving Using SAT Solvers”, in Maple in Mathematics Education and Research - Third Maple Conference, MC 2019, Waterloo, Ontario, Canada, October 15-17, 2019, Proceedings, 2019, vol. 1125, pp. 205–219.
C. Bright, Kotsireas, I. S. , and Ganesh, V. , “SAT solvers and computer algebra systems: a powerful combination for mathematics”, in Proceedings of the 29th Annual International Conference on Computer Science and Software Engineering, CASCON 2019, Markham, Ontario, Canada, November 4-6, 2019, 2019, pp. 323–328.
C. Bright, Ðoković, D. Ž. , Kotsireas, I. S. , and Ganesh, V. , “A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples”, in The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Hono, 2019, pp. 1435–1442.
C. Bright, Dokovic, D. Z. , Kotsireas, I. S. , and Ganesh, V. , “The SAT+CAS method for combinatorial search with applications to best matrices”, Ann. Math. Artif. Intell., vol. 87, pp. 321–342, 2019.
2020
C. Bright, Kotsireas, I. S. , and Ganesh, V. , “Applying computer algebra systems with SAT solvers to the Williamson conjecture”, J. Symb. Comput., vol. 100, pp. 187–209, 2020.
C. Bright, Kotsireas, I. S. , and Ganesh, V. , “New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences”, IEEE Trans. Inf. Theory, vol. 66, pp. 7739–7751, 2020.
C. Bright, Cheung, K. K. H. , Stevens, B. , Roy, D. , Kotsireas, I. S. , and Ganesh, V. , “A nonexistence certificate for projective planes of order ten with weight 15 codewords”, Appl. Algebra Eng. Commun. Comput., vol. 31, pp. 195–213, 2020.
C. Bright, Cheung, K. K. H. , Stevens, B. , Kotsireas, I. S. , and Ganesh, V. , “Nonexistence Certificates for Ovals in a Projective Plane of Order Ten”, in Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings, 2020, vol. 12126, pp. 97–111.
C. Bright, Cheung, K. K. H. , Stevens, B. , Kotsireas, I. S. , and Ganesh, V. , “Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem”, in Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, 2020, pp. 1460–1466.
2021
C. Bright, Kotsireas, I. S. , Heinle, A. , and Ganesh, V. , “Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT”, J. Symb. Comput., vol. 102, pp. 153–172, 2021.
N. Rubin, Bright, C. , Cheung, K. K. H. , and Stevens, B. , “Improving Integer and Constraint Programming for Graeco-Latin Squares”, in 33rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2021, Washington, DC, USA, November 1-3, 2021, 2021, pp. 604–608.

Pages