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)
- 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
- On the bit complexity of polynomial system solving
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- Simultaneous modular reduction and Kronecker substitution for small finite fields
- Using symmetries in the eigenvalue method for polynomial systems
- An alternative class of irreducible polynomials for optimal extension fields
- Real solution isolation with multiplicity of zero-dimensional triangular systems
- Gcd of multivariate polynomials via Newton polytopes
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- On the complexities of multipoint evaluation and interpolation
- Exact, efficient, and complete arrangement computation for cubic curves
- On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
- A Recursive Method for Computing Zeta Functions of Varieties
- On division polynomial PIT and supersingularity
- Topics in computational algebraic number theory
- Arithmetic complexity of certain linear transformations
- Counting Points in Medium Characteristic Using Kedlaya's Algorithm
- Point compression for the trace zero subgroup over a small degree extension field
- On coefficients of polynomials over finite fields
- Computing Hilbert Class Polynomials
- Probabilistic algorithms for computing resolvent representations of regular differential ideals
- Matrix structure and loss-resilient encoding/decoding
- Modular polynomials on Hilbert surfaces
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
- Number of irreducible polynomials and pairs of relatively prime polynomials in several variables over finite fields
- A note on Gröbner bases and Berlekamp's algorithm
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
- On some computations on sparse polynomials
- Fast algorithms for computing Jones polynomials of certain links
- Fast computation of discrete invariants associated to a differential rational mapping
- Computing Zeta Functions in Families of C a,b Curves Using Deformation
- Computations with classical and p-adic modular forms
- Computing class polynomials for abelian surfaces
- On sign conditions over real multivariate polynomials
- Fast conversion algorithms for orthogonal polynomials
- Sparse bivariate polynomial factorization
- The orbit problem is in the GapL hierarchy
- A $p$-adic algorithm to compute the Hilbert class polynomial
- A note on Gao's algorithm for polynomial factorization
- Sparse interpolation of multivariate rational functions
- Dynamical irreducibility of polynomials modulo primes
- Efficient construction of maximal and minimal representations of motifs of a string
- Computing zeta functions of Artin-Schreier curves over finite fields. II
- EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS
- Computation of unirational fields
- Redundancy of minimal weight expansions in Pisot bases
- Sparser Johnson-Lindenstrauss transforms
- The van Hoeij algorithm for factoring polynomials
- Polynomial algebra for Birkhoff interpolants
- Linear dynamical systems over finite rings
- Bounds for polynomials on algebraic numbers and application to curve topology
- Galois group computation for rational polynomials
- A \(p\)-adic algorithm for computing the inverse of integer matrices
- An algorithm for implicit interpolation
- 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
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)
