Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time (Q4673356)

From MaRDI portal
Revision as of 20:48, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57733215, #quickstatements; #temporary_batch_1712201099914)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2162957
Language Label Description Also known as
English
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
scientific article; zbMATH DE number 2162957

    Statements

    Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 April 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity theory
    0 references
    function algebras
    0 references
    Blum-Shub-Smale model
    0 references
    0 references
    0 references