Lower bounds on the complexity of real-time branching programs (Q3815526)

From MaRDI portal
Revision as of 13:06, 19 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Lower bounds on the complexity of real-time branching programs
scientific article

    Statements

    title
    Lower bounds on the complexity of real-time branching programs (English)
    0 references
    author
    Klaus Kriegel
    0 references
    Stephan Waack
    0 references
    publication date
    1988
    0 references
    zbMATH Keywords
    decision graph complexity
    0 references
    Dyck language
    0 references
    lower bounds
    0 references
    branching programs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q05
    0 references
    68Q45
    0 references
    zbMATH DE Number
    4087019
    0 references
    OpenAlex ID
    W112636843
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3815526&oldid=34797913"
    Powered by MediaWiki