18 search results - page 1 / 4 » Modular Arithmetic for Linear Algebra Computations in the Re... |
JSC
1998
13 years 5 months ago
1998
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
CAV
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interp...
ISSAC
2004
Springer
13 years 11 months ago
2004
Springer
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
ANTS
2010
Springer
13 years 9 months ago
2010
Springer
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...