Sciweavers

34 search results - page 5 / 7
» On the span of polynomials with integer coefficients
Sort
View
TCS
2008
13 years 7 months ago
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
JGT
2007
99views more  JGT 2007»
13 years 7 months ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
DM
2008
98views more  DM 2008»
13 years 7 months ago
Constructing equidissections for certain classes of trapezoids
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...
Charles H. Jepsen, Paul Monsky
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 7 months ago
Shallow Circuits with High-Powered Inputs
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Pascal Koiran
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 7 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers