Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444)

From MaRDI portal
Revision as of 02:41, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Complexity of DNF minimization and isomorphism testing for monotone formulas
scientific article

    Statements

    title
    Complexity of DNF minimization and isomorphism testing for monotone formulas (English)
    0 references
    author
    Judy Goldsmith
    0 references
    Matthias Hagen
    0 references
    Martin Mundhenk
    0 references
    publication date
    22 August 2008
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    03D15
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5315340
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    monotone formulas
    0 references
    prime implicants
    0 references
    formula isomorphism
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q939444&oldid=25883306"
    Powered by MediaWiki