Modern computer algebra

MaRDI QIDQ4248250zbMATH OpenFDO

Authors Joachim von zur Gathen, Jürgen Gerhard

Publication date 7 June 1999

Recommendations

scientific article; zbMATH DE number 1936673
scientific article; zbMATH DE number 41264
scientific article; zbMATH DE number 52177
Polynomial algorithms in computer algebra

Cited in

(only showing first 100 items - show all)

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
On the $q$th power algorithm
Symbolic computations of first integrals for polynomial vector fields
Index calculus in the trace zero variety
Modular equations for hyperelliptic curves
Blending implicit interval curves and surfaces
The arithmetic computational complexity of linear transforms
A parametric representation of totally mixed Nash equilibria
A worst-case bound for topology computation of algebraic curves
Sparser Johnson-Lindenstrauss transforms
Zero-nonzero and real-nonreal sign determination
Inversion modulo zero-dimensional regular chains
Incorporating decision procedures in implicit induction.
The complexity of class polynomial computation via floating point approximations
Affine equivalences of trigonometric curves
Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
Parallel computation of real solving bivariate polynomial systems by zero-matching method
Usage of modular techniques for efficient computation of ideal operations
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
Symbolic analysis of multiple steady states in a MAPK chemical reaction network
The enumerability of P collapses P to NC
Change of order for regular chains in positive dimension
On efficient sparse integer matrix Smith normal form computations
Linear recurrent sequences and polynomial roots
Interpolation of polynomials given by straight-line programs
Computing differential characteristic sets by change of ordering
Fast operations on linearized polynomials and their applications in coding theory
Integers and polynomials: comparing the close cousins $\mathbb Z$ and $\mathbb F_q[x]$
Algebra for symbolic computation. Translated from the Italian by Daniele A. Gewurz
Computing isolated roots of sparse polynomial systems in affine space
On multivariate rational function decomposition
Complexity of integer quasiconvex polynomial optimization
A geometric index reduction method for implicit systems of differential algebraic equations
Locating the closest singularity in a polynomial homotopy
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
scientific article; zbMATH DE number 1936673 (Why is no real title available?)
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
Inversion of two level circulant matrices over $\mathbb{Z}_{p}$
Complexity results for triangular sets
Modular composition modulo triangular sets and applications
The complete generating function for Gessel walks is algebraic
Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
Genus 2 point counting over prime fields
An exact and efficient approach for computing a cell in an arrangement of quadrics
Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
Fast arithmetics in Artin-Schreier towers over finite fields
Algorithms for Function Fields
Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems
Factorization patterns on nonlinear families of univariate polynomials over a finite field
Deterministic normal position transformation and its applications
Jebelean-Weber's algorithm without spurious factors
On the complexities of multipoint evaluation and interpolation
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Modern systems of computer algebra
On computation of the greatest common divisor of several polynomials over a finite field.
Exact, efficient, and complete arrangement computation for cubic curves
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
Bit-size estimates for triangular sets in positive dimension
Factoring polynomials over local fields.
On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
Fast computation of Hermite normal forms of random integer matrices
On division polynomial PIT and supersingularity
Complexity bounds on Semaev's naive index calculus method for ECDLP
Additive decompositions of polynomials over unique factorization domains
BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
A Recursive Method for Computing Zeta Functions of Varieties
Computing isomorphisms and embeddings of finite fields
Topology and arrangement computation of semi-algebraic planar curves
Multivariate subresultants in roots
Chinese remainder theorem for cyclotomic polynomials in $\mathbb Z[X]$
Deformation techniques for sparse systems
On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
Topics in computational algebraic number theory
Computing periods of rational integrals
$\mathbf{Li}^{\boldsymbol{(p)}}$-service? An algorithm for computing $\boldsymbol{p}$-adic polylogarithms
On lattice reduction for polynomial matrices
Good reduction of Puiseux series and applications
Algorithms for exponentiation in finite fields
Algebraic osculation and application to factorization of sparse polynomials
Arithmetic complexity of certain linear transformations
A parallel extended GCD algorithm
Computability in linear algebra
Fast convolutions meet Montgomery
A simple and fast algorithm for computing exponentials of power series
Computing cardinalities of $\mathbb{Q}$-curve reductions over finite fields
Efficient sampling of non-strict turnstile data streams
The Rabin cryptosystem revisited
A fast parallel sparse polynomial GCD algorithm
On deterministic sketching and streaming for sparse recovery and norm estimation
Faster integer multiplication using short lattice vectors
Counting Points in Medium Characteristic Using Kedlaya's Algorithm
Deterministic distinct-degree factorization of polynomials over finite fields

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)