Time Bounded Random Access Machines with Parallel Processing (Q4181956)

From MaRDI portal
Revision as of 13:44, 26 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3619312
Language Label Description Also known as
English
Time Bounded Random Access Machines with Parallel Processing
scientific article; zbMATH DE number 3619312

    Statements

    Time Bounded Random Access Machines with Parallel Processing (English)
    0 references
    0 references
    0 references
    1979
    0 references
    Time Bounded Random Access Machines
    0 references
    Parallel Processing
    0 references
    Complexity Of Parallel Algorithms
    0 references
    Uniform Cost Criterion
    0 references
    Equivalence Of Nondeterministic Polynomial Time
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references