Sciweavers

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

96

MFCS
1999
Springer

99views Theoretical Computer Science» more MFCS 1999»

The Complexity of the Extended GCD Problem

15 years 7 months ago

The Complexity of the Extended GCD Problem

Download dimacs.rutgers.edu

George Havas, Jean-Pierre Seifert

Real-time Traffic

MFCS 1999 | Theoretical Computer Science |

claim paper

Related Content

» A Solution to the Extended GCD Problem

» On a Parallel Extended Euclidean Algorithm

» Direct Product Results and the GCD Problem in Old and New Communication Models

» HalfGCD and fast rational recovery

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

» Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Int...

» The CREW PRAM Complexity of Modular Inversion

» Approximate GCDs of polynomials and sparse SOS relaxations

» Componentlevel parallelization of triangular decompositions

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	MFCS
Authors	George Havas, Jean-Pierre Seifert

Comments (0)