scientific article
From MaRDI portal
Publication:3684200
zbMath0568.12001MaRDI QIDQ3684200
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial factorizationmultivariate polynomialspolynomial timebasis reduction algorithmLenstra-Lenstra-Lovasz algorithm
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Polynomials (irreducibility, etc.) (11R09)
Related Items (5)
Solving systems of polynomial inequalities in subexponential time ⋮ Factorization and root-finding for polynomials over division quaternion algebras ⋮ Complexity of deciding the first-order theory of real closed fields ⋮ Complexity of deciding Tarski algebra ⋮ Solving systems of polynomial inequalities over a real closed field in subexponential time
This page was built for publication: