Change of order for regular chains in positive dimension
From MaRDI portal
Publication:2476011
DOI10.1016/j.tcs.2007.10.003zbMath1131.14065OpenAlexW1978562199MaRDI QIDQ2476011
Xavier Dahan, Marc Moreno Maza, Xin Jin, Éric Schost
Publication date: 11 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.003
Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99) Computational aspects in algebraic geometry (14Q99)
Related Items (9)
Inversion Modulo Zero-Dimensional Regular Chains ⋮ Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability ⋮ A signature-based algorithm for computing the nondegenerate locus of a polynomial system ⋮ Sparse FGLM algorithms ⋮ Bit-size estimates for triangular sets in positive dimension ⋮ Relaxed Hensel lifting of triangular sets ⋮ A geometric index reduction method for implicit systems of differential algebraic equations ⋮ Interpolation of polynomials given by straight-line programs ⋮ Computing differential characteristic sets by change of ordering
Uses Software
Cites Work
- 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
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- On computing the determinant in small parallel time using a small number of processors
- Definability and fast quantifier elimination in algebraically closed fields
- The complexity of partial derivatives
- A new method for solving algebraic systems of positive dimension
- On fast multiplication of polynomials over arbitrary algebras
- Matroid theory and its applications in electric network theory and in statics
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Lower bounds for diophantine approximations
- Converting bases with the Gröbner walk
- Straight-line programs in geometric elimination theory
- Computing parametric geometric resolutions
- On the theories of triangular sets
- On the complexity of Gröbner bases conversion
- Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
- Complexity results for triangular sets
- The computational complexity of the Chow form
- The differential ideal \([P : M^ \infty\).]
- Deformation techniques for efficient polynomial equation solving.
- Efficient Groebner walk conversion for implicitization of geometric objects
- Implicitizing rational hypersurfaces using approximation complexes
- Improved explicit estimates on the number of solutions of equations over a finite field
- Fast multiplication of large numbers
- The probability to select the correct model using likelihood-ratio based criteria in choosing between two nested models of which the more extended one is true
- Associative differential operations
- PARDI!
- Change of order for bivariate triangular sets
- Fast computation of a rational point of a variety over a finite field
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Sharp estimates for triangular sets
- Dagwood
- Lifting techniques for triangular decompositions
- Using Galois ideals for computing relative resolvents
- A Gröbner free alternative for polynomial system solving
This page was built for publication: Change of order for regular chains in positive dimension
