Discovering heuristics in a complex SAT solver with large language models
DGX agentarXiv:2507.22876v2 Announce Type: replace Abstract: The Satisfiability problem (SAT) is fundamental in computational complexity theory and has a wide range of industrial applications. Optimizing moder