Sciweavers

165 search results - page 1 / 33
» From an approximate to an exact absolute polynomial factoriz...
Sort
View
JSC
2006
132views more  JSC 2006»
13 years 4 months ago
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Guillaume Chèze, André Galligo
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
13 years 10 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
ISSAC
2007
Springer
93views Mathematics» more  ISSAC 2007»
13 years 10 months ago
Approximate bivariate factorization: a geometric viewpoint
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in   [x, y]. Given a composite polyno...
André Galligo, Mark van Hoeij
ICML
1999
IEEE
14 years 5 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
ARITH
2007
IEEE
13 years 11 months ago
Floating-point L2-approximations to functions
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
Nicolas Brisebarre, Guillaume Hanrot