| Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures E Zulkoski, C Bright, A Heinle, IS Kotsireas, K Czarnecki, V Ganesh Journal of Automated Reasoning 36, 241–256, 2017 | 42 | 2017 |
| Applying computer algebra systems with SAT solvers to the Williamson conjecture C Bright, I Kotsireas, V Ganesh Journal of Symbolic Computation 100, 187–209, 2020 | 40 | 2020 |
| Effective problem solving using SAT solvers C Bright, J Gerhard, I Kotsireas, V Ganesh Maple Conference, 205–219, 2019 | 32 | 2019 |
| MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures C Bright, V Ganesh, A Heinle, I Kotsireas, S Nejati, K Czarnecki International Workshop on Computer Algebra in Scientific Computing, 117–133, 2016 | 28 | 2016 |
| A SAT-based Resolution of Lam's Problem C Bright, KKH Cheung, B Stevens, I Kotsireas, V Ganesh Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3669-3676, 2021 | 26 | 2021 |
| A SAT+CAS Method for Enumerating Williamson Matrices of Even Order C Bright, I Kotsireas, V Ganesh Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence …, 2017 | 20 | 2017 |
| A SAT Solver and Computer Algebra Attack on the Minimum Kochen–Specker Problem (Student Abstract) Z Li, C Bright, V Ganesh Proceedings of the AAAI Conference on Artificial Intelligence 38 (21), 23559 …, 2024 | 19* | 2024 |
| Enumeration of Complex Golay Pairs via Programmatic SAT C Bright, I Kotsireas, A Heinle, V Ganesh ISSAC '18 Proceedings of the 2018 ACM International Symposium on Symbolic …, 2018 | 19 | 2018 |
| When satisfiability solving meets symbolic computation C Bright, I Kotsireas, V Ganesh Communications of the ACM 65 (7), 64-72, 2022 | 18 | 2022 |
| Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT C Bright, I Kotsireas, A Heinle, V Ganesh Journal of Symbolic Computation 102, 153–172, 2021 | 18 | 2021 |
| A nonexistence certificate for projective planes of order ten with weight 15 codewords C Bright, K Cheung, B Stevens, D Roy, I Kotsireas, V Ganesh Applicable Algebra in Engineering, Communication and Computing 31, 195–213, 2020 | 15 | 2020 |
| New infinite families of perfect quaternion sequences and Williamson sequences C Bright, I Kotsireas, V Ganesh IEEE Transactions on Information Theory, 2020 | 12 | 2020 |
| SAT solvers and computer algebra systems: a powerful combination for mathematics C Bright, I Kotsireas, V Ganesh 29th International Conference on Computer Science and Software Engineering …, 2019 | 12 | 2019 |
| A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples C Bright, D Ðokovic, I Kotsireas, V Ganesh Thirty-Third AAAI Conference on Artificial Intelligence, 1435–1442, 2019 | 11 | 2019 |
| Unsatisfiability Proofs for Weight 16 Codewords in Lam’s Problem C Bright, KKH Cheung, B Stevens, I Kotsireas, V Ganesh Twenty-Ninth International Joint Conference on Artificial Intelligence, 1460 …, 2020 | 8 | 2020 |
| Computational methods for combinatorial and number theoretic problems C Bright University of Waterloo, 2017 | 8 | 2017 |
| An SC-Square Approach to the Minimum Kochen–Specker Problem Z Li, C Bright, V Ganesh SC-Square@ FLoC 2022, 2022 | 7 | 2022 |
| Vector rational number reconstruction C Bright, A Storjohann Proceedings of the 36th international symposium on Symbolic and algebraic …, 2011 | 7 | 2011 |
| The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices C Bright, DZ Djoković, I Kotsireas, V Ganesh Annals of Mathematics and Artificial Intelligence 87 (4), 321–342, 2019 | 6 | 2019 |
| Minimal elements for the prime numbers C Bright, R Devillers, J Shallit Experimental Mathematics 25 (3), 321–331, 2016 | 6 | 2016 |
Vijay GaneshProfessor, Georgia Institute of Technology, Atlanta, GA, USAVerified email at gatech.edu
