Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

74

Voted

AMCS
2007

83views Mathematics» more AMCS 2007»

On the Computation of the GCD of 2-D Polynomials

15 years 3 months ago

On the Computation of the GCD of 2-D Polynomials

Download anadrasis.web.auth.gr

Panagiotis Tzekis, Nicholas P. Karampetakis, Haral

Real-time Traffic

AMCS 2007 | Mathematics |

claim paper

Related Content

» TwoDimensional Blind Deconvolution Using a Robust GCD Approach

» Algorithms for polynomial GCD computation over algebraic function fields

» Division algorithms for Bernstein polynomials

» Factorization of Polynomials and GCD Computations for Finding Universal Denominators

» The approximate GCD of inexact polynomials

» Structured Low Rank Approximation of a Bezout Matrix

» Robust Fitting of Implicit Polynomials with Quantized Coefficients to 2D Data

» A sparse modular GCD algorithm for polynomials over algebraic function fields

» A New Characterization of Semibent and Bent Functions on Finite Fields

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2007
Where	AMCS
Authors	Panagiotis Tzekis, Nicholas P. Karampetakis, Haralambos K. Terzidis

Comments (0)