Mycielski graphs and PR proofs

DOI10.1007/978-3-030-51825-7_15OpenAlexW3038418987MaRDI QIDQ2661347

Marijn J. H. Heule, Emre Yolcu, Xin-Yu Wu

Publication date: 7 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-51825-7_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items (1)

Clause redundancy and preprocessing in maximum satisfiability

Uses Software

• Plingeling
• OEIS
• Treengeling
• Lingeling
• YalSAT
• CaDiCaL

This page was built for publication: Mycielski graphs and PR proofs