Error Detection in Number-Theoretic and Algebraic Algorithms
CPU's are unreliable: at any point in a computation, a bit may be altered with some (small) probability. This probability may seem negligible, but for large calculations (i.e., months of CPU time), the likelihood of an error being introduced becomes increasingly significant. Relying on this...
Main Author: | Vasiga, Troy Michael John |
---|---|
Language: | en |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/3895 |
Similar Items
-
Error Detection in Number-Theoretic and Algebraic Algorithms
by: Vasiga, Troy Michael John
Published: (2008) -
On the Number of Witnesses in the Miller–Rabin Primality Test
by: Shamil Talgatovich Ishmukhametov, et al.
Published: (2020-06-01) -
An RSA Scheme based on Improved AKS Primality Testing Algorithm
by: Wu Han Wei, et al.
Published: (2016-01-01) -
Projective Splitting as a Warped Proximal Algorithm
by: Bùi, M.N
Published: (2022) -
A primal-dual exterior point algorithm for linear programming problems
by: Samaras Nikolaos, et al.
Published: (2009-01-01)