Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs
From MaRDI portal
Publication:685715
DOI10.1007/BF01200063zbMath0774.68062MaRDI QIDQ685715
Publication date: 10 October 1993
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01200063
68Q25: Analysis of algorithms and problem complexity
26C10: Real polynomials: location of zeros
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
26C15: Real rational functions
Related Items
Algebraic decision trees and Euler characteristics, Semi-algebraic decision complexity, the real spectrum, and degree
Cites Work