A SAT-plus-LLM method discovers infinite families of doubly saturated Ramsey-good graphs, answering Grinstead and Roberts' 1982 question.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
method 2
citation-polarity summary
roles
method 2polarities
use method 2representative citing papers
A hybrid multimodular polynomial reasoning method verifies arithmetic circuits without large-integer arithmetic by running computations in parallel modulo different primes.
Soteria is a functional library for building direct symbolic execution engines, demonstrated by the first Rust engine supporting Tree Borrows and a compositional C engine that matches or exceeds prior tools.
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
-
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.