Probabilistic algorithms for geometric elimination

DOI10.1007/S002000050115MaRDI QIDQ1304992zbMATH OpenOpenAlexFDO

Authors Guillermo Matera

Publication date 3 April 2000

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002000050115

zbMATH Keywords

Boolean circuitelimination theoryprobabilistic algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Symbolic computation and algebraic computation (68W30)

Recommendations

• The Space Complexity of Elimination Theory: Upper Bounds
• On the time-space complexity of geometric elimination procedures
• On the intrinsic complexity of elimination problems in effective algebraic geometry
• Software engineering and complexity in effective algebraic geometry

Cited in

(13)

• Evaluation techniques for zero-dimensional primary decomposition
• Functional programming concepts and straight-line programs in computer algebra
• Software engineering and complexity in effective algebraic geometry
• Generalized polar varieties: geometry and algorithms
• A concise proof of the Kronecker polynomial system solver from scratch
• The Space Complexity of Elimination Theory: Upper Bounds
• Generalized polar varieties and an efficient real elimination.
• On the intrinsic complexity of elimination problems in effective algebraic geometry
• On the time-space complexity of geometric elimination procedures
• Computing bases of complete intersection rings in Noether position
• A probabilistic algorithm for verification of geometric theorems
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Towards a library for straight-line programs

This page was built for publication: Probabilistic algorithms for geometric elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304992)