On the size of minimal unsatisfiable formulas

zbMath1178.68290arXiv0811.0427MaRDI QIDQ1010894

Choongbum Lee

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

critically 3-connected hypergraphsminimal unsatisfiable formulas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

FPT is characterized by useful obstruction sets

This page was built for publication: On the size of minimal unsatisfiable formulas