scientific article; zbMATH DE number 5198530
From MaRDI portal
Publication:5309031
zbMath1137.68028MaRDI QIDQ5309031
Zhao, Xishun, Hans Kleine Büning
Publication date: 9 October 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityunique satisfiabilityminimal unsatisfiable formulasdisjunctive splittingmarginal MUmaximal MU
Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
How Many Conflicts Does It Need to Be Unsatisfiable? ⋮ Extension and equivalence problems for clause minimal formulae ⋮ On the query complexity of selecting minimal sets for monotone predicates
This page was built for publication:
