1728 search results - page 114 / 346 » The Accelerated Euclidean Algorithm |
100
click to vote
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Two infinite families of self-similar tilings are described which have apparently not been reported before. Each tiling is based on a single prototile that is a segment of a regul...
ISSAC
1998
Springer
15 years 7 months ago
1998
Springer
The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
120
click to vote
DGCI
2006
Springer
15 years 6 months ago
2006
Springer
We introduce a new discrete primitive, the blurred piece of a discrete plane, which relies on the arithmetic definition of discrete planes. It generalizes such planes, admitting th...
113
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
133
click to vote
AAECC
2007
Springer
15 years 3 months ago
2007
Springer
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the o...