Software engineering and complexity in effective algebraic geometry

DOI10.1016/j.jco.2012.04.005zbMath1278.68355arXiv1110.3030OpenAlexW2081485421MaRDI QIDQ1931431

Joos Heintz, Bart Kuijpers, Andrés Rojas Paredes

Publication date: 14 January 2013

Published in: Journal of Complexity (Search for Journal in Brave)

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

zbMATH Keywords

branching parsimonious algorithmflat family of zero dimensional elimination problemsisoparametric routinerobust parameterized arithmetic circuit

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (4)

Quiz games as a model for information hiding ⋮ On the realisability of double-cross matrices by polylines in the plane ⋮ Evaluating geometric queries using few arithmetic operations ⋮ Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity

Uses Software

• Kronecker

This page was built for publication: Software engineering and complexity in effective algebraic geometry