70 search results - page 7 / 14 » A computational introduction to number theory and algebra |
CCS
2008
ACM
13 years 9 months ago
2008
ACM
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
CC
2010
Springer
13 years 4 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
DLT
2008
13 years 9 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
119
click to vote
Book
C code implementation of several math algorithms such as Linear Algebraic Equations,
Interpolation and Extrapolation, Integration of Functions, Evaluation of Functions, Random Num...
PEPM
2007
ACM
14 years 1 months ago
2007
ACM
Having been convinced of the potential benefits of partial evaluation, we wanted to conduct some experiments in our favourite Computer Algebra System, Maple. Maple is a large lan...