Formal proof of prefix adders (Q611751): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Parallel Prefix Computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Regular Layout for Parallel Adders / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mathematics of Program Construction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proofs of Correctness and Properties of Integer Adder Circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new class of parallel algorithms for finding connected components on machines with bit-vector operations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2773752 / rank | |||
Normal rank |
Revision as of 13:25, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Formal proof of prefix adders |
scientific article |
Statements
Formal proof of prefix adders (English)
0 references
14 December 2010
0 references
prefix adders
0 references
computer arithmetic
0 references
semi-group
0 references
VLSI
0 references
0 references
0 references