scientific article

zbMath0958.11080MaRDI QIDQ3836797

Attila Pethoe

Publication date: 2 January 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Thue equationsGröbner basesfactorization of polynomials over finite fieldspolynomial complexitypolynomial ringsBuchberger's algorithmPell equationsprimality testsEuclidean ringsunique factorization domainLLL-algorithmelimination methodideals in polynomial ringsLenstra-Lenstra-Lovász algorithmBerlekamp's algorithmcontinued fraction representationsubresultant algorithmelimination idealsChinese remainder algorithmextended Euclidean algorithmsFincke-Pohst algorithmgcd of univariate polynomialsmeasures for polynomialsShanks factorization method

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computer solution of Diophantine equations (11Y50) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Software, source code, etc. for problems pertaining to number theory (11-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Factorization (11Y05) Primality (11Y11) Computational number theory (11Yxx)

Related Items (4)

On diophantine properties of radix representations in algebraic number fields ⋮ The topological structure of fractal tilings generated by quadratic number systems ⋮ On a second conjecture of Stolarsky: the sum of digits of polynomial values ⋮ On canonical number systems

This page was built for publication: