scientific article
From MaRDI portal
Publication:3963106
zbMath0498.12005MaRDI QIDQ3963106
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Polynomials (irreducibility, etc.) (11R09) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (55)
Lifting and recombination techniques for absolute factorization ⋮ Algebraic diagonals and walks: algorithms, bounds, complexity ⋮ Comments on Risch’s On the Integration of Elementary Functions which are Built Up Using Algebraic Operations ⋮ Integration of Algebraic Functions ⋮ Comments on Integration of Algebraic Functions ⋮ Computing a hyperelliptic integral using arithmetic in the Jacobian of the curve ⋮ Computer algebra: Past and future ⋮ Solving systems of algebraic equations by a general elimination method ⋮ Polynomial factorization algorithms over number fields ⋮ An efficient algorithm for factoring polynomials over algebraic extension field ⋮ Irreducibility testing of finite nilpotent linear groups. ⋮ Univariate polynomial factorization over finite fields ⋮ The Diophantine problem for systems of algebraic equations with exponents ⋮ On the normalization of numbers and functions defined by radicals ⋮ Computing Logarithmic Parts by Evaluation Homomorphisms✱ ⋮ Genus 2 point counting over prime fields ⋮ Irrational Quantum Walks ⋮ \textsc{Rings}: an efficient Java/Scala library for polynomial rings ⋮ Block Systems of a Galois Group ⋮ Using Gröbner bases for finding the logarithmic part of the integral of transcendental functions ⋮ Computing primitive elements of extension fields ⋮ Residues and telescopers for bivariate rational functions ⋮ Intégration algorithmique des fonctions élémentairement transcendantes sur une courbe algébrique ⋮ Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators ⋮ The Turing degrees for some computation model with the real parameter ⋮ Factoring polynomials over global fields. I ⋮ Fast computation of special resultants ⋮ Computation of unirational fields ⋮ The complexity of computing all subfields of an algebraic number field ⋮ An algorithm for decomposing a polynomial system into normal ascending sets ⋮ Formulas for series computations ⋮ Optimal algorithm for algebraic factoring ⋮ Complex spherical codes with three inner products ⋮ Rational solutions of Riccati-like partial differential equations ⋮ Rational Landen transformations on $\mathbb{R}$ ⋮ Indefinite integration as term rewriting: integrals containing tangent ⋮ Landen transformations and the integration of rational functions ⋮ Factoring polynomials over local fields. ⋮ Polynomials with frobenius galois groups ⋮ Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem ⋮ On the extended Hensel construction and its application to the computation of real limit points ⋮ Counting solutions without zeros or repetitions of a linear congruence and rarefaction in \(b\)-multiplicative sequences ⋮ A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function ⋮ Irreducibility testing over local fields ⋮ Algebraic factoring and geometry theorem proving ⋮ Morikawa’s Unsolved Problem ⋮ Polynomials whose Galois groups are Frobenius groups with prime order complement ⋮ On the computation of Hilbert class fields ⋮ A unification of Liouvillian extensions ⋮ Integration of rational functions: Rational computation of the logarithmic part ⋮ Unnamed Item ⋮ Deterministic irreducibility testing of polynomials over large finite fields ⋮ Formal solutions of differential equations ⋮ Real limit points of quasi-componenets of regular chains ⋮ Solvability by radicals is in polynomial time
This page was built for publication:
