On the time-space complexity of geometric elimination procedures
From MaRDI portal
Publication:5938530
DOI10.1007/s002000000046zbMath0977.68101OpenAlexW1964605445MaRDI QIDQ5938530
Ariel Waissbein, Guillermo Matera, Joos Heintz
Publication date: 22 July 2001
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002000000046
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational aspects in algebraic geometry (14Q99)
Related Items
Complexity results for triangular sets, Generalized polar varieties: geometry and algorithms, Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, Polynomial equation solving by lifting procedures for ramified fibers, Deformation techniques to solve generalised Pham systems, A concise proof of the Kronecker polynomial system solver from scratch, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Relaxed Hensel lifting of triangular sets, Intrinsic complexity estimates in polynomial optimization, A Gröbner free alternative for polynomial system solving, On the complexity of the resolvent representation of some prime differential ideals, An algorithm for implicit interpolation, Unnamed Item, Evaluation techniques for zero-dimensional primary decomposition, Fast computation of a rational point of a variety over a finite field, Functional programming concepts and straight-line programs in computer algebra, Degeneracy loci and polynomial equation solving, Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity, Systems of rational polynomial equations have polynomial size approximate zeros on the average
Uses Software
