Tight bounds for tseitin formulas

DOI10.4230/LIPICS.SAT.2022.6MaRDI QIDQ6572017zbMATH OpenFDO

Authors Dmitry Itsykson, Artur Riazanov, Petr Smirnov

Publication date 12 July 2024

zbMATH Keywords

treewidthresolutionproof complexityTseitin formulasOBDD-based proof systems

Mathematics Subject Classification ID

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

This page was built for publication: Tight bounds for tseitin formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572017)