Green-Tao Numbers and SAT

DOI10.1007/978-3-642-14186-7_32zbMath1259.68182arXiv1004.0653OpenAlexW1522816367MaRDI QIDQ4930604

Oliver Kullmann

Publication date: 29 September 2010

Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.0653

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Ramsey theory (05D10) Arithmetic progressions (11B25)

Related Items (6)

On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) ⋮ Are hitting formulas hard for resolution? ⋮ On Variables with Few Occurrences in Conjunctive Normal Forms ⋮ Optimal symmetry breaking for graph problems ⋮ The SAT+CAS method for combinatorial search with applications to best matrices ⋮ A nonexistence certificate for projective planes of order ten with weight 15 codewords

Uses Software

• UBCSAT

This page was built for publication: Green-Tao Numbers and SAT