A SAT-plus-LLM method discovers infinite families of doubly saturated Ramsey-good graphs, answering Grinstead and Roberts' 1982 question.
In: Gurfinkel, A., Ganesh, V
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
A hybrid multimodular polynomial reasoning method verifies arithmetic circuits without large-integer arithmetic by running computations in parallel modulo different primes.
Augmenting SAT solvers with the Euler-Parker algorithm solves hard 10x10 orthogonal Latin square problems in a median of 5100 seconds instead of failing after seven days.
citing papers explorer
-
Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery
A SAT-plus-LLM method discovers infinite families of doubly saturated Ramsey-good graphs, answering Grinstead and Roberts' 1982 question.
-
Avoiding Big Integers: Parallel Multimodular Algebraic Verification of Arithmetic Circuits
A hybrid multimodular polynomial reasoning method verifies arithmetic circuits without large-integer arithmetic by running computations in parallel modulo different primes.
-
Improving SAT Solvers on Orthogonal Latin Square Problems
Augmenting SAT solvers with the Euler-Parker algorithm solves hard 10x10 orthogonal Latin square problems in a median of 5100 seconds instead of failing after seven days.