Sciweavers

JGO
2008
90views more  JGO 2008»
13 years 4 months ago
A scaling algorithm for polynomial constraint satisfaction problems
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Ferenc Domes, Arnold Neumaier
IPL
2006
88views more  IPL 2006»
13 years 4 months ago
Improved construction for universality of determinant and permanent
Valiant (1979) proved that every polynomial of formula size e is a projection of the (e + 2)
Hong Liu, Kenneth W. Regan
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 4 months ago
Q-adic Transform revisited
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...
Jean-Guillaume Dumas
JCT
2008
59views more  JCT 2008»
13 years 4 months ago
The Jones polynomial and graphs on surfaces
The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the li...
Oliver T. Dasbach, David Futer, Efstratia Kalfagia...
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 4 months ago
FPRAS for computing a lower bound for weighted matching polynomial of graphs
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
Shmuel Friedland
CORR
2007
Springer
85views Education» more  CORR 2007»
13 years 4 months ago
A multivariate interlace polynomial
We define a multivariate polynomial that generalizes in a unified way the twovariable interlace polynomial defined by Arratia, Bollob´as and Sorkin on the one hand, and a one-...
Bruno Courcelle
JC
2008
77views more  JC 2008»
13 years 4 months ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...
CAGD
2007
75views more  CAGD 2007»
13 years 4 months ago
Computing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
Michael Barton, Bert Jüttler
FOCM
2006
59views more  FOCM 2006»
13 years 4 months ago
Newton-Hensel Interpolation Lifting
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in Z[x] from information modulo a...
Martin Avendano, Teresa Krick, Ariel Pacetti
DM
2006
68views more  DM 2006»
13 years 4 months ago
A note on maximally repeated sub-patterns of a point set
We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial,...
Véronique Cortier, Xavier Goaoc, Mira Lee, ...