Improving Combinatorial Bounds Using SAT Solvers: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:4914:49, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,285 bytes +2,285‎ Created page with "Title: Improving Combinatorial Bounds Using SAT Solvers Abstract: This research explores the use of Satisfiability (SAT) solvers to improve combinatorial bounds, specifically focusing on van der Waerden numbers. The study demonstrates that recent advancements in SAT solvers have made it possible to obtain new results in combinatorics by encoding problems as propositional theories and then computing their models using general-purpose SAT solvers. The paper also argues th..."
Retrieved from "https://simplesci.org/wiki/Improving_Combinatorial_Bounds_Using_SAT_Solvers"