37 search results - page 6 / 8 » On the Degree of Univariate Polynomials Over the Integers |
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
Shirayanagi and Sweedler proved that a large class of algorithms over the reals can be modified slightly so that they also work correctly on fixed-precision floating-point numb...
FSTTCS
2001
Springer
14 years 2 months ago
2001
Springer
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
DM
2008
13 years 9 months ago
2008
We investigate equidissections of a trapezoid T(a), where the ratio of the lengths of two parallel sides is a. (An equidissection is a dissection into triangles of equal areas.) A...
ASAP
2007
IEEE
14 years 4 months ago
2007
IEEE
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...