Recommendations
- On the complexity of computing with zero-dimensional triangular sets
- Complexity of triangular representations of algebraic sets
- On the complexity of the independent set problem in triangle graphs
- scientific article; zbMATH DE number 2151241
- On the Bit-Size of Non-radical Triangular Sets
- The generic complexity of the graph triangulation problem
- Fast arithmetic for triangular sets: from theory to practice
- Fast arithmetic for triangular sets: from theory to practice
- Polynomial time relatively computable triangular arrays for almost sure convergence
- Bit-size estimates for triangular sets in positive dimension
Cites work
- A Gröbner free alternative for polynomial system solving
- A new method for solving algebraic systems of positive dimension
- A p-adic approach to the computation of Gröbner bases
- Application of the method of Dem'yanenko-Manin to certain families of curves of genus 2 or 3
- Bounds of traces in complete intersections and degrees in the Nullstellensatz
- Computing parametric geometric resolutions
- Definability and fast quantifier elimination in algebraically closed fields
- Deformation techniques for efficient polynomial equation solving.
- Fast multiplication of large numbers
- Fast multivariate power series multiplication in characteristic zero
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 4132308 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 16648 (Why is no real title available?)
- scientific article; zbMATH DE number 16654 (Why is no real title available?)
- scientific article; zbMATH DE number 16657 (Why is no real title available?)
- scientific article; zbMATH DE number 1254247 (Why is no real title available?)
- scientific article; zbMATH DE number 1736021 (Why is no real title available?)
- scientific article; zbMATH DE number 1057737 (Why is no real title available?)
- scientific article; zbMATH DE number 1057749 (Why is no real title available?)
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- scientific article; zbMATH DE number 2081155 (Why is no real title available?)
- scientific article; zbMATH DE number 2151241 (Why is no real title available?)
- scientific article; zbMATH DE number 204997 (Why is no real title available?)
- scientific article; zbMATH DE number 939802 (Why is no real title available?)
- scientific article; zbMATH DE number 939812 (Why is no real title available?)
- scientific article; zbMATH DE number 837111 (Why is no real title available?)
- Large torsion subgroups of split Jacobians of curves of genus two or three
- Lower bounds for diophantine approximations
- Modern computer algebra
- Modular equations for hyperelliptic curves
- On improving approximate results of Buchberger's algorithm by Newton's method
- On intrinsic bounds in the Nullstellensatz
- On the theories of triangular sets
- On the time-space complexity of geometric elimination procedures
- Quadratic Newton iteration for systems with multiplicity
- Relations between roots and coefficients, interpolation and application to system solving
- Resultants and moving surfaces
- Sharp estimates for the arithmetic Nullstellensatz
- Solving zero-dimensional algebraic systems
- Solving zero-dimensional systems through the rational univariate representation
- Straight-line programs in geometric elimination theory
- The complexity of partial derivatives
- The differential ideal \([P] : M^ \infty\).
Cited in
(26)- A new method for solving algebraic systems of positive dimension
- Complexity of triangular representations of algebraic sets
- On the complexity of computing with zero-dimensional triangular sets
- Complexity of solving parametric polynomial systems
- On approximate triangular decompositions in dimension zero
- Change of order for regular chains in positive dimension
- An application of regular chain theory to the study of limit cycles
- Change of order for bivariate triangular sets
- On the complexity of the D5 principle
- Modular composition modulo triangular sets and applications
- On the Bit-Size of Non-radical Triangular Sets
- Sharp estimates for triangular sets
- scientific article; zbMATH DE number 2151241 (Why is no real title available?)
- Relaxed Hensel lifting of triangular sets
- Modular equations for hyperelliptic curves
- Irredundant triangular decomposition
- Elimination of unknowns for systems of algebraic differential-difference equations
- Lifting techniques for triangular decompositions
- Fast arithmetic for triangular sets: from theory to practice
- Optimization techniques for small matrix multiplication
- On the links between triangular sets and dynamic constructible closure
- On computing absolutely irreducible components of algebraic varieties with parameters
- Bit-size estimates for triangular sets in positive dimension
- Decomposition of polynomial ideals into triangular regular sequences
- Properness defects of projection and minimal discriminant variety
- Sum-and-quotient characteristic decomposition of polynomial ideals
This page was built for publication: Complexity results for triangular sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878489)
