On balanced versus unbalanced computation trees (Q4887490)

From MaRDI portal
Revision as of 05:00, 11 November 2023 by Importer (talk | contribs) (‎Created a new 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

    On balanced versus unbalanced computation trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 1996
    0 references
    0 references
    leaf languages
    0 references
    nondeterministic polynomial-time machines
    0 references
    PP computations
    0 references