2430 search results - page 15 / 486 » Computing Tutte Polynomials |
CASES
2004
ACM
14 years 1 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
CSC
2006
13 years 9 months ago
2006
: - There are many numerical methods adopted to solve mathematical problems. Early researchers focused on the methods to reduce computational costs. In recent years, reduction in c...
JUCS
2007
13 years 7 months ago
2007
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
CASC
2010
Springer
13 years 6 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...