Curtis Bright

Curtis Bright

University of Windsor

H-index: 10

North America-Canada

About Curtis Bright

Curtis Bright, With an exceptional h-index of 10 and a recent h-index of 10 (since 2020), a distinguished researcher at University of Windsor, specializes in the field of Computer-assisted Proofs, Symbolic Computation, Satisfiability Solving, Discrete Mathematics, Experimental Mathematics.

His recent articles reflect a diverse array of research interests and contributions to the field:

A SAT+Computer Algebra System Verification of the Ramsey Problem (Student Abstract)

A SAT Solver and Computer Algebra Attack on the Minimum Kochen–Specker Problem (Student Abstract)

AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems

A Hybrid SAT and Lattice Reduction Approach for Integer Factorization

SAT Solvers, Isomorph-free Generation, and the Quest for the Minimum Kochen–Specker System

Preface selected revised papers from the {LION} 14 conference

Solving Lam’s Problem via SAT and Isomorph-Free Exhaustive Generation

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract)

Curtis Bright Information

University

Position

___

Citations(all)

280

Citations(since 2020)

236

Cited By

155

hIndex(all)

10

hIndex(since 2020)

10

i10Index(all)

11

i10Index(since 2020)

10

Email

University Profile Page

Google Scholar

Curtis Bright Skills & Research Interests

Computer-assisted Proofs

Symbolic Computation

Satisfiability Solving

Discrete Mathematics

Experimental Mathematics

Top articles of Curtis Bright

A SAT+Computer Algebra System Verification of the Ramsey Problem (Student Abstract)

Proceedings of the AAAI Conference on Artificial Intelligence

2024/3/24

A SAT Solver and Computer Algebra Attack on the Minimum Kochen–Specker Problem (Student Abstract)

Proceedings of the AAAI Conference on Artificial Intelligence

2024/3/24

AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems

arXiv preprint arXiv:2401.13770

2024/1/24

A Hybrid SAT and Lattice Reduction Approach for Integer Factorization

Proceedings of the 8th International Workshop on Satisfiability Checking and Symbolic Computation, Tromsø, Norway

2023/7

Curtis Bright
Curtis Bright

H-Index: 7

SAT Solvers, Isomorph-free Generation, and the Quest for the Minimum Kochen–Specker System

2023/2/7

Curtis Bright
Curtis Bright

H-Index: 7

Preface selected revised papers from the {LION} 14 conference

Ann. Math

2022/9/1

Curtis Bright
Curtis Bright

H-Index: 7

Curtis Bright
Curtis Bright

H-Index: 7

Curtis Bright
Curtis Bright

H-Index: 7

Solving Lam’s Problem via SAT and Isomorph-Free Exhaustive Generation

2022/8/3

Curtis Bright
Curtis Bright

H-Index: 7

Vijay Ganesh
Vijay Ganesh

H-Index: 25

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract)

Proceedings of the AAAI Conference on Artificial Intelligence

2022/6/28

Curtis Bright
Curtis Bright

H-Index: 7

Kevin Cheung
Kevin Cheung

H-Index: 13

When satisfiability solving meets symbolic computation

2022/6/21

Curtis Bright
Curtis Bright

H-Index: 7

Vijay Ganesh
Vijay Ganesh

H-Index: 25

Searching for Kochen–Specker Systems With Orderly Generation and Satisfiability Solving

Program Committee Chair

2022/6/16

Curtis Bright
Curtis Bright

H-Index: 7

Isomorph-Free Exhaustive Generation in SAT Solving

2022/2/17

Curtis Bright
Curtis Bright

H-Index: 7

An SC-Square Approach to the Minimum Kochen–Specker Problem

SC-Square Workshop

2022

Enumerating Projective Planes of Order Nine with Proof Verification

2022

Curtis Bright
Curtis Bright

H-Index: 7

Improving Integer and Constraint Programming for Graeco-Latin Squares

2021/11/1

Curtis Bright
Curtis Bright

H-Index: 7

Kevin Cheung
Kevin Cheung

H-Index: 13

Hadamard 160 in Cool Tones

2021/10/12

Curtis Bright
Curtis Bright

H-Index: 7

A SAT-based Resolution of Lam's Problem

Proceedings of the AAAI Conference on Artificial Intelligence

2021/5/18

Curtis Bright
Curtis Bright

H-Index: 7

Vijay Ganesh
Vijay Ganesh

H-Index: 25

Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT

Journal of Symbolic Computation

2021/1/1

Curtis Bright
Curtis Bright

H-Index: 7

Vijay Ganesh
Vijay Ganesh

H-Index: 25

SAT Solving with Computer Algebra

2020/2/28

Curtis Bright
Curtis Bright

H-Index: 7

A new lower bound in the ???????????? conjecture

2020

Curtis Bright
Curtis Bright

H-Index: 7

Satisfiability Checking+ Symbolic Computation: A New Approach to Combinatorial Mathematics

2020

Curtis Bright
Curtis Bright

H-Index: 7

Vijay Ganesh
Vijay Ganesh

H-Index: 25

See List of Professors in Curtis Bright University(University of Windsor)

Co-Authors

academic-engine