Probabilistic parallel prefix computation (Q2367585): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Time Required to Perform Addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5549816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addition of Binary Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the length of addition chains / rank
 
Normal rank

Latest revision as of 17:29, 17 May 2024

scientific article
Language Label Description Also known as
English
Probabilistic parallel prefix computation
scientific article

    Statements

    Probabilistic parallel prefix computation (English)
    0 references
    2 September 1993
    0 references
    probabilistic prefix computation problem
    0 references
    fan-in circuits
    0 references
    error probability
    0 references
    error-free circuits
    0 references
    parallel evaluation
    0 references
    0 references

    Identifiers