Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
type: Item
instance of: scholarly article
title: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
zbMATH Open document ID: 1061.68072
DOI: 10.1016/S0304-3975(01)00337-1
author: Herbert Fleischner
author: Oliver Kullmann
author: Stefan Szeider
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1857075
zbMATH Keywords: Minimal unsatisfiable
zbMATH Keywords: SAT
zbMATH Keywords: Deficiency
zbMATH Keywords: Matching
zbMATH Keywords: Autarky
zbMATH Keywords: Polynomial time algorithm
Wikidata QID: Q60060025
MaRDI profile type: Publication
cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
cites work: Q4947393
cites work: A perspective on certain polynomial-time solvable classes of satisfiability
cites work: Q3042418
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Q4385525
cites work: Q4263797
cites work: On subclasses of minimal unsatisfiable formulas
cites work: Investigations on autark assignments
cites work: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
cites work: Matching theory
cites work: Theorem-Proving for Computers: Some Results on Resolution and Renaming
cites work: The complexity of facets resolved
cites work: Two tractable subclasses of minimal unsatisfiable formulas
DBLP publication ID: journals/tcs/FleischnerKS02
description: scientific article; zbMATH DE number 1857075