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 (only showing first 100 items - show all)

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

This page was built for publication: