Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer

@inproceedings{Heule2016SolvingAV,
  title={Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer},
  author={Marijn J. H. Heule and O. Kullmann and V. Marek},
  booktitle={SAT},
  year={2016}
}
The boolean Pythagorean Triples problem has been a longstanding open problem in Ramsey Theory: Can the set N = $\{1, 2, ...\}$ of natural numbers be divided into two parts, such that no part contains a triple $(a,b,c)$ with $a^2 + b^2 = c^2$ ? A prize for the solution was offered by Ronald Graham over two decades ago. We solve this problem, proving in fact the impossibility, by using the Cube-and-Conquer paradigm, a hybrid SAT method for hard problems, employing both look-ahead and CDCL… Expand
Cube-and-Conquer for Satisfiability
Formally Verifying the Solution to the Boolean Pythagorean Triples Problem
Everything's Bigger in Texas: "The Largest Math Proof Ever"
Schur Number Five
Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures
The SAT+CAS method for combinatorial search with applications to best matrices
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 72 REFERENCES
Satisfiability and Computing van der Waerden Numbers
Coloring so that no Pythagorean Triple is Monochromatic
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
The van der Waerden Number W(2, 6) Is 1132
kcnfs: An Efficient Solver for Random k-SAT Formulae
Computers and Intractability: A Guide to the Theory of NP-Completeness
Compositional Propositional Proofs
...
1
2
3
4
5
...