43 search results - page 3 / 9 » Elementary Algebraic Specifications of the Rational Complex ... |
ICDE
1999
IEEE
14 years 7 months ago
1999
IEEE
Active database management systems have been developed for applications needing an automatic reaction in response to certain events. Events can be simple in nature or complex. Com...
ISSAC
2005
Springer
13 years 11 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
ANTS
2010
Springer
13 years 9 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...