Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable

DOI10.1007/3-540-45071-8_55zbMath1276.68086OpenAlexW1493350325MaRDI QIDQ3082962

Stefan Szeider

Publication date: 18 March 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/610/1/610.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (1)

Generalizations of matched CNF formulas

This page was built for publication: Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable