2430 search results - page 29 / 486 » Computing Tutte Polynomials |
CIE
2009
Springer
14 years 2 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...
GIAE
2004
Springer
14 years 1 months ago
2004
Springer
For a first order autonomous ODE, we give a polynomial time algorithm to decide whether it has a polynomial general solution and to compute one if it exists. Experiments show that...
AAECC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
CAGD
2002
13 years 7 months ago
2002
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial param...
JSC
1998
13 years 7 months ago
1998
The nearest singular polynomials to a given polynomial have been studied in [1], based on minimization of quadratic forms. An equivalent expression of the quadratic form is present...