Pages that link to "Item:Q5725754"

The following pages link to A New Version of the Euclidean Algorith (Q5725754):

Displaying 27 items.

• An application of the Hermite normal form in integer programming (Q757241) (← links)
• Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review (Q779712) (← links)
• The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
• Complexity questions in number theory (Q1059094) (← links)
• A duality property for the set of all feasible solutions to an integer program (Q1078071) (← links)
• Using the Blankinship algorithm to find the general solution of a linear diophantine equation (Q1259617) (← links)
• Synthesis aspects in the design of efficient processor arrays from affine recurrence equations (Q1322844) (← links)
• Geometrical tools to map systems of affine recurrence equations on regular arrays (Q1323382) (← links)
• Factorization properties of lattices over the integers (Q1345515) (← links)
• Quasi-affine transformations: Tilings by reciprocal images (Q1366679) (← links)
• Structured matrix methods computing the greatest common divisor of polynomials (Q1678991) (← links)
• Which pivot to solve linear systems? (Q1860424) (← links)
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← links)
• On digital plane preimage structure (Q2573239) (← links)
• Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
• (Q3342292) (← links)
• Solving rank one perturbed linear Diophantine systems by the ABS method (Q3423597) (← links)
• Digital plane preimage structure (Q3438921) (← links)
• Multidimensional greatest common divisor and Lehmer algorithms (Q4156838) (← links)
• Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (Q4228028) (← links)
• Part I-Smith form and common divisor of polynomial matrices (Q4775731) (← links)
• The Geometry of the Intersection of Voxel Spaces (Q4917107) (← links)
• Computation of the GCD of polynomials using gaussian transformations and shifting (Q5287932) (← links)
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857) (← links)
• Comparison of algorithms for calculation of g.c.d. of polynomials (Q5668674) (← links)
• Quasi-affine transformations and parings of the discret plane (Q5941279) (← links)
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies (Q5961649) (← links)