MathCheck
From MaRDI portal
Cited in
(19)- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Investigating the existence of orthogonal golf designs via satisfiability testing
- Investigating the existence of Costas Latin squares via satisfiability testing
- CPGraph
- tawSolver
- Hadamard
- Lynx
- SageSAT
- nsoks
- CnC
- FourierSAT
- New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences
- A nonexistence certificate for projective planes of order ten with weight 15 codewords
- The SAT+CAS method for combinatorial search with applications to best matrices
- Matchings extend to Hamiltonian cycles in 5-cube
- Applying computer algebra systems with SAT solvers to the Williamson conjecture
- Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT
- Enumeration of complex Golay pairs via programmatic SAT
This page was built for software: MathCheck
