The complexity of languages of type UM (Q4190140)

From MaRDI portal
Revision as of 16:42, 26 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3628387
Language Label Description Also known as
English
The complexity of languages of type UM
scientific article; zbMATH DE number 3628387

    Statements

    title
    The complexity of languages of type UM (English)
    0 references
    author
    R. G. Nigmatullin
    0 references
    publication date
    1978
    0 references
    zbMATH Keywords
    Computational Complexity
    0 references
    Minimization of Boolean Functions
    0 references
    Disjunctive Normal Form
    0 references
    Language
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68W99
    0 references
    68Q45
    0 references
    03G05
    0 references
    94C10
    0 references
    zbMATH DE Number
    3628387
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4190140&oldid=8654751"
      Powered by MediaWiki