Publications

Search
Author Title Type [ Year(Asc)]
2019
C. Bright, Đoković, D. Ž. , Kotsireas, I. , and Ganesh, V. , “The SAT+CAS method for combinatorial search with applications to best matrices”, Annals of Mathematics and Artificial Intelligence, 2019.
C. Bright, Kotsireas, I. , Heinle, A. , and Ganesh, V. , “Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT”, Journal of Symbolic Computation, 2019.
C. Bright, Kotsireas, I. , 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, Riverton, NJ, USA, 2019, pp. 323–328.
C. Bright, Kotsireas, I. , and Ganesh, V. , “Applying computer algebra systems with SAT solvers to the Williamson conjecture”, Journal of Symbolic Computation, 2019.
C. Bright, Ðoković, D. Ž. , Kotsireas, I. , and Ganesh, V. , “A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples”, in Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019.
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), 2018, pp. 6573–6580.
C. Bright, Kotsireas, I. , and Ganesh, V. , “The SAT+CAS paradigm and the Williamson conjecture”, Communications in Computer Algebra, vol. 52, pp. 82–84, 2018.
2017
E. Zulkoski, Bright, C. , Heinle, A. , Kotsireas, I. , Czarnecki, K. , and Ganesh, V. , “Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures”, Journal of Automated Reasoning, 2017.
C. Bright, “Computational Methods for Combinatorial and Number Theoretic Problems”, 2017.
2016
C. Bright, Ganesh, V. , Heinle, A. , Kotsireas, I. , Nejati, S. , and Czarnecki, K. , “MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures”, in Computer Algebra in Scientific Computing, 2016.
C. Bright, Ganesh, V. , Heinle, A. , Kotsireas, I. , Nejati, S. , and Czarnecki, K. , “MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures”, in Workshop on Satisfiability Checking and Symbolic Computation, 2016.
C. Bright, Devillers, R. , and Shallit, J. , “Minimal Elements for the Prime Numbers”, Journal of Experimental Mathematics, 2016.
2011
C. Bright and Storjohann, A. , “Vector Rational Number Reconstruction”, in International Symposium on Symbolic and Algebraic Computation, 2011.