387 search results - page 21 / 78 » On the design of a Java computer algebra system |
TCOS
2010
13 years 3 months ago
2010
Abstract. In [24] Raddum and Semaev propose a technique to solve systems of polynomial equations over F2 as occurring in algebraic attacks on block ciphers. This approach is known ...
DIS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
SIAMSC
2008
13 years 8 months ago
2008
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...
PERCOM
2008
ACM
13 years 8 months ago
2008
ACM
The pervasive computing environment will be composed of heterogeneous services. In this work, we have explored how a domain specific language for service composition can be implem...