1383 search results - page 52 / 277 » On the Complexity of the Interlace Polynomial |
141
click to vote
BIRTHDAY
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
162
click to vote
JSC
2008
15 years 6 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...
154
click to vote
FOCM
2007
15 years 6 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
237
click to vote
CASC
2011
Springer
14 years 6 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...
164
click to vote
ISSAC
2009
Springer
16 years 21 days ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...