Compact SD: a new encoding algorithm and its application in multiplication (Q5737882): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the OBDD complexity of the most significant bit of integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SIGNED BINARY MULTIPLICATION TECHNIQUE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive \(m\)-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel and Uniform $k$-Partition Method for Montgomery Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word-Based Montgomery Modular Multiplication Algorithm for Low-Latency Scalable Architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast modular multiplication based on complement representation and canonical recoding / rank
 
Normal rank

Latest revision as of 21:20, 13 July 2024

scientific article; zbMATH DE number 6724322
Language Label Description Also known as
English
Compact SD: a new encoding algorithm and its application in multiplication
scientific article; zbMATH DE number 6724322

    Statements

    Identifiers