Curtis Bright

Orcid: 0000-0002-0462-625X

Affiliations:
  • University of Windsor, Ontario, Canada


According to our database1, Curtis Bright authored at least 32 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems.
CoRR, 2024

A SAT + Computer Algebra System Verification of the Ramsey Problem R(3, 8) (Student Abstract).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem (Student Abstract).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem.
CoRR, 2023

A New Lower Bound in the abc Conjecture.
CoRR, 2023

A Hybrid SAT and Lattice Reduction Approach for Integer Factorization.
Proceedings of the 8th SC-Square Workshop co-located with the 48th International Symposium on Symbolic and Algebraic Computation, 2023

2022
When satisfiability solving meets symbolic computation.
Commun. ACM, 2022

An SC-Square Approach to the Minimum Kochen-Specker Problem.
Proceedings of the 7th SC-Square Workshop co-located with the Federated Logic Conference, 2022

Enumerating Projective Planes of Order Nine with Proof Verification.
Proceedings of the 7th SC-Square Workshop co-located with the Federated Logic Conference, 2022

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract).
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT.
J. Symb. Comput., 2021

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares.
CoRR, 2021

Improving Integer and Constraint Programming for Graeco-Latin Squares.
Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

A SAT-based Resolution of Lam's Problem.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences.
IEEE Trans. Inf. Theory, 2020

Applying computer algebra systems with SAT solvers to the Williamson conjecture.
J. Symb. Comput., 2020

A nonexistence certificate for projective planes of order ten with weight 15 codewords.
Appl. Algebra Eng. Commun. Comput., 2020

Nonexistence Certificates for Ovals in a Projective Plane of Order Ten.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
The SAT+CAS method for combinatorial search with applications to best matrices.
Ann. Math. Artif. Intell., 2019

Effective Problem Solving Using SAT Solvers.
Proceedings of the Maple in Mathematics Education and Research - Third Maple Conference, 2019

SAT solvers and computer algebra systems: a powerful combination for mathematics.
Proceedings of the 29th Annual International Conference on Computer Science and Software Engineering, 2019

A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture.
CoRR, 2018

The SAT+CAS paradigm and the Williamson conjecture.
ACM Commun. Comput. 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

2017
Computational Methods for Combinatorial and Number Theoretic Problems.
PhD thesis, 2017

Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures.
J. Autom. Reason., 2017

2016
Minimal Elements for the Prime Numbers.
Exp. Math., 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

2011
Vector rational number reconstruction.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011


  Loading...