3454 search results - page 168 / 691 » Modern computer algebra |
174
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
We present three examples of the composition of Computer Algebra Systems to illustrate the progress on a composability infrastructure as part of the SCIEnce (Symbolic Computation I...
186
click to vote
PDP
2010
IEEE
16 years 1 months ago
2010
IEEE
—Two strategies of distribution of computations can be used to implement parallel solvers for dense linear algebra problems for Heterogeneous Computational Clusters of Multicore ...
148
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
233
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
200
click to vote
ANTS
2010
Springer
15 years 9 months ago
2010
Springer
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...