Pages that link to "Item:Q1680251"
From MaRDI portal
The following pages link to An empirical study of branching heuristics through the lens of global learning rate (Q1680251):
Displaying 5 items.
- 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)
- Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness (Q5014692) (← links)
- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten (Q5041183) (← links)