2430 search results - page 71 / 486 » Computing Tutte Polynomials |
132
Voted
JSC
2008
15 years 2 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
103
click to vote
COMBINATORICS
2004
15 years 2 months ago
2004
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
156
click to vote
TRIER
2002
15 years 2 months ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
181
Voted
CASC
2011
Springer
14 years 2 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
115
click to vote
STOC
2010
ACM
15 years 12 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...