Q5313698
type: Item
instance of: scholarly article
zbMATH Open document ID: 1070.03505
publication date: 2005-09-01T00:00:00Z
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03B05
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 2201270
zbMATH Keywords: reduction algorithm
zbMATH Keywords: conjunctive normal form
zbMATH Keywords: minimal unsatisfiable formulas
author: Ji'an Wang
author: Daoyun Xu
MaRDI profile type: MaRDI publication profile
Recommended article: Applications of minimal unsatisfiable formulas to polynomially reduction for formulas
Recommended article: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Recommended article: Two tractable subclasses of minimal unsatisfiable formulas
Recommended article: SAT-Problems and Reductions with Respect to the Number of Variables
Recommended article: Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
description: scientific article; zbMATH DE number 2201270