Sciweavers

1998 search results - page 77 / 400
» Complexity of the Cover Polynomial
Sort
View
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
14 years 7 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
PDCAT
2009
Springer
14 years 4 months ago
Balanced Dense Polynomial Multiplication on Multi-Cores
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...
Marc Moreno Maza, Yuzhen Xie
BIRTHDAY
2007
Springer
14 years 4 months ago
Generating Polynomial Invariants with DISCOVERER and QEPCAD
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...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan
JSC
2008
162views more  JSC 2008»
13 years 10 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
FOCM
2007
48views more  FOCM 2007»
13 years 10 months ago
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace
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...
Alexander I. Barvinok