Modern computer algebra
From MaRDI portal
Publication:4248250
zbMATH Open0936.11069MaRDI QIDQ4248250FDOQ4248250
Authors: Joachim von zur Gathen, Jürgen Gerhard 
Publication date: 7 June 1999
Recommendations
interpolationcomplexitycomputer algebraEuclidean algorithmcryptographyprimality testssymbolic integrationsymbolic summationfactorization of integersfast Fourier transform algorithmfactorization of polynomials over finite fieldsresultant computationGröbner basesRSA methodasymptotic cost of algorithmsasymptotically fast methodsHensel lifting lemmaLLL methodmodular calculus
Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05) Primality (11Y11) Computational number theory (11Yxx)
Cited In (only showing first 100 items - show all)
- Distribution results for low-weight binary representations for pairs of integers
- Symbolic-numerical solution of systems of linear ordinary differential equations with required accuracy
- A worst-case bound for topology computation of algebraic curves
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x]\)
- On efficient sparse integer matrix Smith normal form computations
- Interpolation of polynomials given by straight-line programs
- Computing differential characteristic sets by change of ordering
- Computing isolated roots of sparse polynomial systems in affine space
- On multivariate rational function decomposition
- Title not available (Why is that?)
- A geometric index reduction method for implicit systems of differential algebraic equations
- The complete generating function for Gessel walks is algebraic
- Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\)
- Complexity results for triangular sets
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
- Modular composition modulo triangular sets and applications
- Genus 2 point counting over prime fields
- Fast arithmetics in Artin-Schreier towers over finite fields
- Factoring polynomials over local fields.
- BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Bit-size estimates for triangular sets in positive dimension
- Fast computation of Hermite normal forms of random integer matrices
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- Topology and arrangement computation of semi-algebraic planar curves
- Computing periods of rational integrals
- Deformation techniques for sparse systems
- On lattice reduction for polynomial matrices
- Good reduction of Puiseux series and applications
- Algorithms for exponentiation in finite fields
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Algebraic osculation and application to factorization of sparse polynomials
- Computability in linear algebra
- A simple and fast algorithm for computing exponentials of power series
- Factoring multivariate polynomials via partial differential equations
- On modular inverses of cyclotomic polynomials and the magnitude of their coefficients
- Irreducible decomposition of curves
- Computing modular polynomials in quasi-linear time
- Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- Factors of low individual degree polynomials
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
- Relax, but don't be too lazy
- Constructing high order elements through subspace polynomials
- A New Algorithm for Decoding Reed-Solomon Codes
- Simple forms of higher-order linear differential systems and their applications in computing regular solutions
- A new method to compute the singularities of offsets to rational plane curves
- Factoring polynomials over global fields
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- A polynomial time algorithm for finding rational general solutions of first order autonomous ODEs
- Factoring polynomials over finite fields: A survey
- Subresultants revisited.
- On the complexity of the resolvent representation of some prime differential ideals
- Linear differential operators for polynomial equations
- Polynomial evaluation and interpolation on special sets of points
- Root refinement for real polynomials using quadratic interval refinement
- Primality testing with Gaussian periods
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Gaussian laws for the main parameters of the Euclid algorithms
- Automatic Calculation of Plane Loci Using Gröbner Bases and Integration into a Dynamic Geometry System
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
- Certified dense linear system solving
- Efficient decomposition of separable algebras.
- Representation attacks on the Braid Diffie-Hellman public key encryption
- Polynomial root separation examples
- Fast algorithms for computing isogenies between elliptic curves
- An algebraic approach to continuous collision detection for ellipsoids
- An elementary approach to subresultants theory.
- Faà di Bruno's formula, lattices, and partitions
- Indefinite summation of rational functions with factorization of denominators
- Polynomial factorization over ${\mathbb F}_2$
- On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
- An algorithm to solve integer linear systems exactly using numerical methods
- Construction of explicit Runge-Kutta pairs with stiffness detection
- High-order lifting and integrality certification
- Equivalence of polynomial identity testing and polynomial factorization
- Title not available (Why is that?)
- On the Complexity of the Montes Ideal Factorization Algorithm
- Fast computation of special resultants
- Computing modular Galois representations
- Homotopy techniques for multiplication modulo triangular sets
- Modern computer algebra
- An application of the method of additive chains to inversion in finite fields
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- On irreducible divisors of iterated polynomials
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
- Fast arithmetic for triangular sets: from theory to practice
- Modular equations for hyperelliptic curves
- Index calculus in the trace zero variety
- Blending implicit interval curves and surfaces
- Sparser Johnson-Lindenstrauss transforms
- A parametric representation of totally mixed Nash equilibria
- Incorporating decision procedures in implicit induction.
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- Affine equivalences of trigonometric curves
- Change of order for regular chains in positive dimension
- Fast operations on linearized polynomials and their applications in coding theory
- Complexity of integer quasiconvex polynomial optimization
This page was built for publication: Modern computer algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248250)
