2430 search results - page 55 / 486 » Computing Tutte Polynomials |
JSC
2006
13 years 10 months ago
2006
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
PKC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
ISSAC
1997
Springer
14 years 2 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
In this paper, we describe the design of a C library named PTPol implementing arithmetic operations for univariate polynomials and report on practical experiments showing the rele...
DAM
2008
13 years 10 months ago
2008
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...