2430 search results - page 60 / 486 » Computing Tutte Polynomials |
107
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I. The criterion used in the computation involves specific commutation polynomial...
141
click to vote
CAP
2010
14 years 9 months ago
2010
The multiplication of the sparse multivariate polynomials using the recursive representations is revisited to take advantage on the multicore processors. We take care of the memor...
111
click to vote
COMPUTING
2006
15 years 2 months ago
2006
The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of t...
DCC
2002
IEEE
16 years 2 months ago
2002
IEEE
Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field Fp by polynomials modulo p and modulo p -1, re...
ENTCS
2008
15 years 2 months ago
2008
Consider the initial-value problem with computable parameters dx dt = p(t, x) x(t0) = x0, where p : Rn+1 Rn is a vector of polynomials and (t0, x0) Rn+1 . We show that the proble...