Finding Lower Bounds for Nondeterministic State Complexity Is Hard (Q3617075)

From MaRDI portal
Revision as of 04:39, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
scientific article

    Statements

    title
    Finding Lower Bounds for Nondeterministic State Complexity Is Hard (English)
    0 references
    author
    Hermann Gruber
    0 references
    Markus Holzer
    0 references
    publication date
    26 March 2009
    0 references

    Identifiers

    DOI
    10.1007/11779148_33
    0 references
    zbMATH DE Number
    5533841
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3617075&oldid=17049480"
    Powered by MediaWiki