Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Formula Isomorphism Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of some classical equivalence relations on boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Monotone Dualization and Generating Hypergraph Transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Boolean dualization is in co-NP\([\log^{2}n]\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log Space Recognition and Translation of Parenthesis Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / 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: Q5822054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum equivalent DNF problem and shortest implicants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 15:18, 28 June 2024

scientific article
Language Label Description Also known as
English
Complexity of DNF minimization and isomorphism testing for monotone formulas
scientific article

    Statements

    Complexity of DNF minimization and isomorphism testing for monotone formulas (English)
    0 references
    0 references
    0 references
    0 references
    22 August 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    monotone formulas
    0 references
    prime implicants
    0 references
    formula isomorphism
    0 references
    0 references