Weak parallel machines: A new class of physically feasible parallel machine models (Q5096822): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1176242
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Juraj Wiedermann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded hardware is equivalent to deterministic Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a complexity theory of synchronous parallel computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Physical parallel devices are not much faster than sequential ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750126 / rank
 
Normal rank

Latest revision as of 22:44, 29 July 2024

scientific article; zbMATH DE number 7573127
Language Label Description Also known as
English
Weak parallel machines: A new class of physically feasible parallel machine models
scientific article; zbMATH DE number 7573127

    Statements

    Weak parallel machines: A new class of physically feasible parallel machine models (English)
    0 references
    18 August 2022
    0 references
    0 references

    Identifiers