Probabilistic algorithms for geometric elimination

DOI10.1007/s002000050115zbMath0934.68122OpenAlexW2020604307MaRDI QIDQ1304992

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

elimination theoryprobabilistic algorithmsBoolean circuit

Mathematics Subject Classification ID

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

Related Items

Generalized polar varieties: geometry and algorithms, A concise proof of the Kronecker polynomial system solver from scratch, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Computing bases of complete intersection rings in Noether position, Unnamed Item, Evaluation techniques for zero-dimensional primary decomposition, Functional programming concepts and straight-line programs in computer algebra