scientific article; zbMATH DE number 1936673
For a review of the first edition see Zbl 0936.11069. Publisher's description: Computer algebra systems are gaining importance in all areas of science and engineering. This textbook gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. It is designed to accompany one- or two-semester courses for advanced undergraduate or graduate students in computer science or mathematics. Its comprehensiveness and authority also make it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). Some of this material has never appeared before in book form. For the new edition, errors have been corrected, the text has been smoothed and updated, and new sections on greatest common divisors and symbolic integration have been added.
- The digit generating function of a polynomial
- On the Moser- and super-reduction algorithms of systems of linear differential equations and their complexity
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Evaluation techniques for zero-dimensional primary decomposition
- Quasi-quadratic elliptic curve point counting using rigid cohomology
- On the complexity of integer matrix multiplication
- A new method for recognising Suzuki groups
- Distorting the volcano
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Bivariate factorization using a critical fiber
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Message encoding and retrieval for spread and cyclic orbit codes
- Sparse FGLM algorithms
- On the computation of the HNF of a module over the ring of integers of a number field
- Computing the bound of an Ore polynomial. Applications to factorization
- Improved algorithms for computing determinants and resultants
- Computing sparse multiples of polynomials
- Multi-point evaluation in higher dimensions
- Elliptic curve discrete logarithm problem over small degree extension fields
- Superfast solution of Toeplitz systems based on syzygy reduction
- On computation of Boolean involutive bases
- On factoring parametric multivariate polynomials
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- Computational aspects of ordered integer partitions with bounds
- Infinitely many quasi-coincidence point solutions of multivariate polynomial problems
- Analysis of generalized continued fraction algorithms over polynomials
- Noisy polynomial interpolation modulo prime powers
- On elements of large order on elliptic curves and multiplicative dependent images of rational functions over finite fields
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Computing critical points for invariant algebraic systems
- Lagrangian-antidiffusive remap schemes for non-local multi-class traffic flow models
- Efficient Gröbner bases computation over principal ideal rings
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- Solving determinantal systems using homotopy techniques
- Genus computation of global function fields
- Detecting similarity of rational plane curves
- Multiplicative congruences with variables from short intervals
- Accelerating indefinite summation: simple classes of summands
- A deterministic algorithm for inverting a polynomial matrix
- Generalized Walsh bases and applications
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- On the extended Hensel construction and its application to the computation of real limit points
- A verified implementation of algebraic numbers in Isabelle/HOL
- Implicit-explicit methods for a class of nonlinear nonlocal gradient flow equations modelling collective behaviour
- Overdetermined systems of sparse polynomial equations
- The RCH method for computing minimal polynomials of polynomial matrices
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- On the complexity of the \(F_5\) Gröbner basis algorithm
- The Rees algebra of a monomial plane parametrization
- Computing the Gromov hyperbolicity of a discrete metric space
- Formally verified certificate checkers for hardest-to-round computation
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form
- Lifting and recombination techniques for absolute factorization
- The shifted number system for fast linear algebra on integer matrices
- Symmetry detection of rational space curves from their curvature and torsion
- A concise proof of the Kronecker polynomial system solver from scratch
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- Spread decoding in extension fields
- Codes over finite quotients of polynomial rings
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Factoring bivariate polynomials using adjoints
- Faster arithmetic for number-theoretic transforms
- Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields
- Polynomial root finding over local rings and application to error correcting codes
- Counting points on hyperelliptic curves in average polynomial time
- Existence and properties of \(k\)-normal elements over finite fields
- Validated numerical computation of the \(\mathcal L_{\infty}\)-norm for linear dynamical systems
- Improved dense multivariate polynomial factorization algorithms
- Testing set proportionality and the Ádám isomorphism of circulant graphs
- Computing the modular inverses is as simple as computing the GCDs
- Recognizing and parametrizing curves isomorphic to a line
- Recognising the Suzuki groups in their natural representations.
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Rational univariate reduction via toric resultants
- Block diagonalization and LU-equivalence of Hankel matrices
- Algebraic diagonals and walks: algorithms, bounds, complexity
- On the Cipolla-Lehmer type algorithms in finite fields
- Faster sparse multivariate polynomial interpolation of straight-line programs
- Fast algorithms for solving equations of degree \(\le 4\) in some finite fields
- On oracle factoring of integers
- Modern systems of computer algebra
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Unconditional class group tabulation of imaginary quadratic fields to \(| \Delta| < 2^{40}\)
- A sequence of nearest polynomials with given factors
- Computing characteristic polynomials of matrices of structured polynomials
- A recombination algorithm for the decomposition of multivariate rational functions
- Polly cracker, revisited
- Statistics of Different Reduction Types of Fermat Curves
- Computing Igusa class polynomials
- Taking roots over high extensions of finite fields
- Modern computer algebra
- Computing the torsion points of a variety defined by lacunary polynomials
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions
- Deterministic root finding over finite fields using Graeffe transforms
- On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
- Integral Representation and Algorithms for Closed Form Summation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4406533)