Open AccessJournal Article
The art of computer programming. Vol.2: Seminumerical algorithms
Reads0
Chats0
About:
This article is published in Literacy.The article was published on 1981-01-01 and is currently open access. It has received 2636 citations till now. The article focuses on the topics: Computer programming.read more
Citations
More filters
Journal ArticleDOI
Hyperbolic Julia Sets are Poly-Time Computable
TL;DR: It is proved that hyperbolic Julia sets are locally computable in polynomial time, and an alternative real set computability definition due to Ko is introduced, and some evidence suggesting that one cannot expect a much better computability result for Julia sets is provided.
Book
Fixed-Point Signal Processing
W.T. Padgett,David V. Anderson +1 more
TL;DR: This book is intended to fill the gap between the "ideal precision" digital signal processing (DSP) that is widely taught, and the limited precision implementation skills that are commonly required in fixed-point processors and field programmable gate arrays (FPGAs).
Journal ArticleDOI
Choose the damping, choose the ranking?
Marco Bressan,Enoch Peserico +1 more
TL;DR: The novel notions of strong rank and weak rank of a node provide a measure of the fuzziness of the rank of that node, of the objective orderability of a graph's nodes, and of the quality of results returned by different ranking algorithms based on the random surfer model.
Journal ArticleDOI
Modular exponentiation via the explicit Chinese remainder theorem
TL;DR: A new result on the parallel complexity of modular exponentiation is obtained: there is an algorithm for the Common CRCW PRAM that, given positive integers x, e, and m in binary, of total bit length n, computes x e mod m in time O(n/lglgn) using n O(1) processors.
Proceedings ArticleDOI
Design and implementation of a coprocessor for cryptography applications
TL;DR: An ASIC suitable for cryptography applications based on modular arithmetic techniques, which works as a coprocessor with a special set of instructions specialized in dealing with high accuracy integers, as well as on the rapid evaluation of modular multiplications and exponentiations.