On balanced versus unbalanced computation trees (Q4887490)

From MaRDI portal
Revision as of 13:53, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 913012
Language Label Description Also known as
English
On balanced versus unbalanced computation trees
scientific article; zbMATH DE number 913012

    Statements

    title
    On balanced versus unbalanced computation trees (English)
    0 references
    DOI
    10.1007/BF01192696
    0 references
    author
    Ulrich Hertrampf
    0 references
    Heribert Vollmer
    0 references
    Klaus W. Wagner
    0 references
    publication date
    5 August 1996
    0 references
    zbMATH DE Number
    913012
    0 references
    zbMATH Keywords
    leaf languages
    0 references
    nondeterministic polynomial-time machines
    0 references
    PP computations
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4887490&oldid=34165546"
    Powered by MediaWiki