scientific article; zbMATH DE number 1936673

Joachim von zur Gathen, Jürgen Gerhard

Publication date: 25 June 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Polynomials, factorization in commutative rings (13P05) Computational number theory (11Yxx)

Related Items

A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line, Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form, A multimodular algorithm for computing Bernoulli numbers, Computing the torsion points of a variety defined by lacunary polynomials, Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, Lifting and recombination techniques for absolute factorization, Algebraic diagonals and walks: algorithms, bounds, complexity, MULTIPLICATIVE CHARACTER SUMS OF A CLASS OF NONLINEAR RECURRENCE VECTOR SEQUENCES, On the Cipolla-Lehmer type algorithms in finite fields, Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry, Faster sparse multivariate polynomial interpolation of straight-line programs, Power Decoding of Reed–Solomon Codes Revisited, The shifted number system for fast linear algebra on integer matrices, A subquadratic algorithm for computing the $n$-th Bernoulli number, Irreducibility Criteria for Reciprocal Polynomials and Applications, Symmetry detection of rational space curves from their curvature and torsion, Fast algorithms for solving equations of degree $\le 4$ in some finite fields, Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation, On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes, A concise proof of the Kronecker polynomial system solver from scratch, Efficient Disjointness Tests for Private Datasets, Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation, On the evaluation of some sparse polynomials, Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time, Rigorous uniform approximation of D-finite functions using Chebyshev expansions, On oracle factoring of integers, 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, An Improved Multi-set Algorithm for the Dense Subset Sum Problem, Computing Omega-Limit Sets in Linear Dynamical Systems, Modular polynomials via isogeny volcanoes, 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, Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms, Local computation of differents and discriminants, Computing the modular inverses is as simple as computing the GCDs, Recognizing and parametrizing curves isomorphic to a line, On taking square roots without quadratic nonresidues over finite fields, Modular chemical geometry and symbolic calculation, Mathematical methods and symbolic calculation in chemistry and chemical biology—The gathering momentum, The Prouhet-Tarry-Escott problem for Gaussian integers, Complexity of OM factorizations of polynomials over local fields, Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs, Asymptotically fast polynomial matrix algorithms for multivariable systems, Recognising the Suzuki groups in their natural representations., Fast construction of irreducible polynomials over finite fields, LLL: A Tool for Effective Diophantine Approximation, Integral Representation and Algorithms for Closed Form Summation, A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space, Average-case linear matrix factorization and reconstruction of low width algebraic branching programs, Unconditional class group tabulation of imaginary quadratic fields to $\|\Delta \| < 2^{40}$, The crucial constants in the exponential-type error estimates for Gaussian interpolation, On the extended Hensel construction and its application to the computation of real limit points, A Sequence of Nearest Polynomials with Given Factors, A survey of some recent bit-parallel $\mathrm{GF}(2^n)$ multipliers, Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding, Approximate Polynomial gcd: Small Degree and Small Height Perturbations, Speeding-Up Lattice Reduction with Random Projections (Extended Abstract), Rational univariate reduction via toric resultants, Computing the Distance between Piecewise-Linear Bivariate Functions, Sharp precision in Hensel lifting for bivariate polynomial factorization, Computing Hilbert class polynomials with the Chinese remainder theorem, Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields, MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING, A verified implementation of algebraic numbers in Isabelle/HOL, Calculating cyclotomic polynomials, SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING, Implicit-explicit methods for a class of nonlinear nonlocal gradient flow equations modelling collective behaviour, Code Generation for Polynomial Multiplication, On Computing the Hermite Form of a Matrix of Differential Polynomials, Computing Characteristic Polynomials of Matrices of Structured Polynomials, Simplified High-Speed High-Distance List Decoding for Alternant Codes, A time-space tradeoff for Lehman’s deterministic integer factorization method, A recombination algorithm for the decomposition of multivariate rational functions, Computing persistent homology with various coefficient fields in a single pass, Computing prime divisors in an interval, A fast algorithm for reversion of power series, Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields, Counting composites with two strong liars, Towards an Implementation of a Computer Algebra System in a Functional Language, Block diagonalization and LU-equivalence of Hankel matrices, 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, Statistics of Different Reduction Types of Fermat Curves, Computing Igusa class polynomials, Taking roots over high extensions of finite fields, 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, A combinatorial polynomial algorithm for the linear Arrow-Debreu market, Formally verified certificate checkers for hardest-to-round computation, Chinese Remainder Theorem for bivariate lexicographic Gröbner bases, Skew differential Goppa codes and their application to McEliece cryptosystem, Syndrome decoding in the head: shorter signatures from zero-knowledge proofs, Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity, Decision problem for a class of univariate Pfaffian functions, \textsc{Rings}: an efficient Java/Scala library for polynomial rings, Fast tabulation of challenge pseudoprimes, Secure Implementation of Lattice-Based Encryption Schemes, Zero counting for a class of univariate Pfaffian functions, A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, Polly cracker, revisited, On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation, Deterministic root finding over finite fields using Graeffe transforms, Algorithms for near solutions to polynomial equations, On the complexity of integer matrix multiplication, Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach, Simple algorithms for decoding systematic Reed-Solomon codes, Structured matrices in the application of bivariate interpolation to curve implicitization, A non-NP-complete algorithm for a quasi-fixed polynomial problem, Lagrangian-antidiffusive remap schemes for non-local multi-class traffic flow models, A new method for recognising Suzuki groups, Modular Las Vegas algorithms for polynomial absolute factorization, A lifting and recombination algorithm for rational factorization of sparse polynomials, Distorting the volcano, Exact symbolic-numeric computation of planar algebraic curves, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, Optimal algorithms of Gram-Schmidt type, Bivariate factorization using a critical fiber, Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes, Computing sparse multiples of polynomials, Involutions of polynomially parametrized surfaces, On the distribution of Atkin and Elkies primes, A local decision test for sparse polynomials, Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization, Multi-point evaluation in higher dimensions, Non-linear polynomial selection for the number field sieve, Approximate GCD of several univariate polynomials with small degree perturbations, Triangular $x$-basis decompositions and derandomization of linear algebra algorithms over $K[x$], Probabilistic analyses of the plain multiple gcd algorithm, On the isotopic meshing of an algebraic implicit surface, Sylvester's double sums: an inductive proof of the general case, Class polynomials for nonholomorphic modular functions, On the topology of real algebraic plane curves, Message encoding and retrieval for spread and cyclic orbit codes, On weak keys and forgery attacks against polynomial-based MAC schemes, Efficient algorithms for order basis computation, Elliptic curve discrete logarithm problem over small degree extension fields, Superfast solution of Toeplitz systems based on syzygy reduction, Moving in a network under random failures: a complexity analysis, Intersecting two classical groups., Efficient Gröbner bases computation over principal ideal rings, Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems, Sparse FGLM algorithms, On the computation of the HNF of a module over the ring of integers of a number field, On computation of Boolean involutive bases, Relaxed algorithms for $p$-adic numbers, On factoring parametric multivariate polynomials, Detecting lacunary perfect powers and computing their roots, The module isomorphism problem reconsidered., Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Subresultants, Sylvester sums and the rational interpolation problem, Separating linear forms and rational univariate representations of bivariate systems, Solving determinantal systems using homotopy techniques, Computational complexity of sentences over fields, A simple and fast online power series multiplication and its analysis, Homotopy techniques for solving sparse column support determinantal polynomial systems, A fast isomorphism test for groups whose Lie algebra has genus 2, Degeneration of structured integer matrices modulo an integer, Dynamics of linear systems over finite commutative rings, A new faster algorithm for factoring skew polynomials over finite fields, A pre-test for factoring bivariate polynomials with coefficients in $\mathbb F_2$, Solving Łukasiewicz $\mu$-terms, Solving structured linear systems with large displacement rank, Counting reducible and singular bivariate polynomials, Genus computation of global function fields, Detecting similarity of rational plane curves, Computing the bound of an Ore polynomial. Applications to factorization, Multiplicative congruences with variables from short intervals, Specializations of indecomposable polynomials, Accelerating indefinite summation: simple classes of summands, A deterministic algorithm for inverting a polynomial matrix, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Generalized Walsh bases and applications, Improved algorithms for computing determinants and resultants, Computational aspects of ordered integer partitions with bounds, Computing in degree $2^k$-extensions of finite fields of odd characteristic, Fast arithmetic in unramified $p$-adic fields, New progress in real and complex polynomial root-finding, Key equations for list decoding of Reed-Solomon codes and how to solve them, Deterministically testing sparse polynomial identities of unbounded degree, Infinitely many quasi-coincidence point solutions of multivariate polynomial problems, Approximate polynomial GCD: small degree and small height perturbations, Indecomposability of polynomials via Jacobian matrix, Fast arithmetics using Chinese remaindering, Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem, On the complexity of noncommutative polynomial factorization, Analysis of generalized continued fraction algorithms over polynomials, Optimal routing in double loop networks, Noisy polynomial interpolation modulo prime powers, Large element orders and the characteristic of Lie-type simple groups., Constructive recognition of classical groups in odd characteristic., On elements of large order on elliptic curves and multiplicative dependent images of rational functions over finite fields, 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, Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one, Evaluation techniques for zero-dimensional primary decomposition, Quasi-quadratic elliptic curve point counting using rigid cohomology, Computing critical points for invariant algebraic systems