Sciweavers

2430 search results - page 44 / 486
» Computing Tutte Polynomials
Sort
View
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
14 years 3 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...
ICCAD
2007
IEEE
234views Hardware» more  ICCAD 2007»
14 years 1 months ago
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
Sivaram Gopalakrishnan, Priyank Kalla, M. Brandon ...
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile
IPPS
2003
IEEE
14 years 3 months ago
Importance of SIMD Computation Reconsidered
In this paper, SIMD and MIMD solutions for the realtime database management problem of air traffic control are compared. A real-time database system is highly constrained in a mul...
Will C. Meilander, Johnnie W. Baker, Mingxian Jin
SPAA
2003
ACM
14 years 3 months ago
Polynomial time algorithms for network information flow
Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolh...