On the complexity of computing with zero-dimensional triangular sets

DOI10.1016/j.jsc.2012.05.008zbMath1332.68300arXiv1109.4323OpenAlexW2088713140MaRDI QIDQ1930161

Éric Schost, Adrien Poteaux

Publication date: 10 January 2013

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.4323

zbMATH Keywords

modular compositionpower projectiontriangular setschange of orderequiprojectable decomposition

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30)

Related Items

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, On the complexity exponent of polynomial system solving, Real root finding for low rank linear matrices, Directed evaluation, Computing real radicals and \(S\)-radicals of polynomial systems, Block-Krylov techniques in the context of sparse-FGLM algorithms, Decomposition of polynomial sets into characteristic pairs, Computing Puiseux series: a fast divide and conquer algorithm, Accelerated tower arithmetic, Computing critical points for invariant algebraic systems

Uses Software

• Maple
• ISOLATE