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...
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...
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...
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...
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....