2 papers
math.CO2025
From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
Markus Kirchweger, Tomáš Peitl, Bernardo Subercaseaux +1
Norin (2008) conjectured that any -edge-coloring of the hypercube in which antipodal edges receive different colors must contain a monochromatic path between some pair of…
cs.AI2022
Are Hitting Formulas Hard for Resolution?
Tomáš Peitl, Stefan Szeider
Hitting formulas, introduced by Iwama, are an unusual class of propositional CNF formulas. Not only is their satisfiability decidable in polynomial time, but even their models can…