An approximating k-ary GCD algorithm

Sh. T. Ishmukhametov

Type: Article

Publication Date: 2016-11-01

Citations: 11

DOI: https://doi.org/10.1134/s1995080216060147

View Publication

Locations

Lobachevskii Journal of Mathematics - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Approximate GCD in a Bernstein Basis	2020	Robert M. Corless Leili Rafiee Sevyeri
+	The complexity of the extended GCD problem	1999	George Havas Jean‐Pierre Seifert
+	Algebraic factorization and GCD computation	2000	Lihong Zhi
+ PDF Chat	Bit complexity of polynomial GCD on sparse representation	2024	Qiao-Long Huang Xiao-Shan Gao
+	GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation	1989	Bruce W. Char K. O. Geddes Gastón H. Gonnet
+	A $p$-adic quasi-quadratic time point counting algorithm	2009	David Lubicz Robert Carls
+	GPGCD: An iterative method for calculating approximate GCD of univariate polynomials	2012	Akira Terui
+	On Polynomial Approximation in A q (D)	1973	Thomas A. Metzger
+ PDF Chat	Approximate common divisor problem and lattice sieving	2018	Kirill Dmitrievich Zhukov
+	Division algorithm and Kronecker’s approximation theorem	2020	Gaurav Aggarwal Jitender Singh
+	An Introduction to Polynomial Approximation Theory	1970	James Steven Boyce
+	A generalisation of the Cantor-Zassenhaus algorithm	1997	Christian Hidber
+ PDF Chat	Practical algorithms for multivariate rational approximation	2020	Anthony P. Austin Mohan Krishnamoorthy Sven Leyffer S. Mrenna Juliane Müller H. Schulz
+	Polynomial-Like Approximation	1954	Oliver Groß
+	The Quadratic Sieve Algorithm	1985	Carl Pomerance
+	Two new algorithms for rational approximation	1961	E. W. Cheney H. L. Loeb
+	The Quadratic Sieve Factoring Algorithm	2007	Carl Pomerance
+	Berlekamp-Massey algorithm	2006	Anne Canteaut
+	A p-adic Euclidean Algorithm	2009	Cortney Lager
+	A Combinatorial Interpretation of the Quotient-Difference Algorithm	2000	Xavier Gérard Viennot

Works That Cite This (2)

Action	Title	Year	Authors
+ PDF Chat	On a new algorithm for computing GCD of integer numbers	2020	Ishmukhametov ST Mubarakov BG Rubtsova RG Arkan Mohammed Al Khalidi
+ PDF Chat	Real Number Approximation by a Rational Number in the Approximating k-ary Algorithm	2019	R.R. Enikeev

Works Cited by This (7)

Action	Title	Year	Authors
+	Schnelle Berechnung von Kettenbruchentwicklungen	1971	Arnold Schönhage
+ PDF Chat	Strong pseudoprimes to twelve prime bases	2016	Jonathan Sorenson Jonathan Webster
+	An Introduction to the Bootstrap	1994	Bradley Efron Robert Tibshirani
+	The number of steps in the Euclidean algorithm	1970	John D. Dixon
+	A generalization of the binary GCD algorithm	1993	Tudor Jebelean
+ PDF Chat	An introduction to the theory of numbers	1960	G. H. Hardy
+	An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)	1946	T. A. A. B.