Complexity results for triangular sets
From MaRDI portal
Publication:1878489
DOI10.1016/S0747-7171(03)00095-6zbMath1074.68082MaRDI QIDQ1878489
Publication date: 20 August 2004
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)
Related Items (13)
Modular equations for hyperelliptic curves ⋮ Modular composition modulo triangular sets and applications ⋮ Complexity of triangular representations of algebraic sets ⋮ Bit-size estimates for triangular sets in positive dimension ⋮ Elimination of unknowns for systems of algebraic differential-difference equations ⋮ Relaxed Hensel lifting of triangular sets ⋮ On approximate triangular decompositions in dimension zero ⋮ Change of order for regular chains in positive dimension ⋮ Optimization techniques for small matrix multiplication ⋮ Complexity of solving parametric polynomial systems ⋮ Properness defects of projection and minimal discriminant variety ⋮ On computing absolutely irreducible components of algebraic varieties with parameters ⋮ AN APPLICATION OF REGULAR CHAIN THEORY TO THE STUDY OF LIMIT CYCLES
Uses Software
Cites Work
- On intrinsic bounds in the Nullstellensatz
- Relations between roots and coefficients, interpolation and application to system solving
- Definability and fast quantifier elimination in algebraically closed fields
- A p-adic approach to the computation of Gröbner bases
- The complexity of partial derivatives
- A new method for solving algebraic systems of positive dimension
- Solving zero-dimensional algebraic systems
- Application of the method of Dem'yanenko-Manin to certain families of curves of genus 2 or 3
- Solving zero-dimensional systems through the rational univariate representation
- Lower bounds for diophantine approximations
- Straight-line programs in geometric elimination theory
- Computing parametric geometric resolutions
- On the theories of triangular sets
- Sharp estimates for the arithmetic Nullstellensatz
- Quadratic Newton iteration for systems with multiplicity
- Bounds of traces in complete intersections and degrees in the Nullstellensatz
- The differential ideal \([P : M^ \infty\).]
- Deformation techniques for efficient polynomial equation solving.
- Fast multiplication of large numbers
- On improving approximate results of Buchberger's algorithm by Newton's method
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Modular equations for hyperelliptic curves
- Large torsion subgroups of split Jacobians of curves of genus two or three
- On the time-space complexity of geometric elimination procedures
- Resultants and moving surfaces
- A Gröbner free alternative for polynomial system solving
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity results for triangular sets
