The complexity of variable minimal formulas

DOI10.1007/s11434-010-3127-2zbMath1196.68099OpenAlexW1963548648MaRDI QIDQ708020

Baowen Xu, Zhen-Yu Chen, Ding, Decheng

Publication date: 8 October 2010

Published in: Chinese Science Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11434-010-3127-2

zbMATH Keywords

minimal unsatisfiabilityprime implicationvariable minimal equivalencevariable minimal satisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

Automatically generating test data from a Boolean specification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of facets (and some facets of complexity)
• The complexity of facets resolved
• The minimum equivalent DNF problem and shortest implicants
• Two tractable subclasses of minimal unsatisfiable formulas
• Implication-Based Approximating Bounded Model Checking
• Tools and Algorithms for the Construction and Analysis of Systems
• The complexity of theorem-proving procedures
• Theory and Applications of Models of Computation

This page was built for publication: The complexity of variable minimal formulas