The complexity of variable minimal formulas (Q708020): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Implication-Based Approximating Bounded Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two tractable subclasses of minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5473177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5473156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum equivalent DNF problem and shortest implicants / rank
 
Normal rank

Revision as of 08:06, 3 July 2024

scientific article
Language Label Description Also known as
English
The complexity of variable minimal formulas
scientific article

    Statements

    The complexity of variable minimal formulas (English)
    0 references
    0 references
    0 references
    0 references
    8 October 2010
    0 references
    minimal unsatisfiability
    0 references
    prime implication
    0 references
    variable minimal equivalence
    0 references
    variable minimal satisfiability
    0 references

    Identifiers