The following pages link to nsoks (Q32873):
Displayed 4 items.
- Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT (Q2200304) (← links)
- Applying computer algebra systems with SAT solvers to the Williamson conjecture (Q2307627) (← links)
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures (Q2829996) (← links)
- Enumeration of Complex Golay Pairs via Programmatic SAT (Q5120185) (← links)