The following pages link to Curtis Bright (Q780358):
Displaying 14 items.
- A nonexistence certificate for projective planes of order ten with weight 15 codewords (Q780361) (← links)
- Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT (Q2200304) (← links)
- The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) (← links)
- Applying computer algebra systems with SAT solvers to the Williamson conjecture (Q2307627) (← links)
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
- Minimal Elements for the Prime Numbers (Q2815500) (← links)
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures (Q2829996) (← links)
- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten (Q5041183) (← links)
- Enumeration of Complex Golay Pairs via Programmatic SAT (Q5120185) (← links)
- New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences (Q5138930) (← links)
- Vector rational number reconstruction (Q5254153) (← links)
- A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples (Q6309599) (← links)
- Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem (Q6333896) (← links)
- A SAT-based Resolution of Lam's Problem (Q6355609) (← links)
