Counting complexity classes for numeric computations II

DOI10.1145/1007352.1007425zbMath1192.68289OpenAlexW2134035034MaRDI QIDQ3580991

Felipe Cucker, Peter Bürgisser

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007425

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

The complexity to compute the Euler characteristic of complex varieties ⋮ Two logical hierarchies of optimization problems over the real numbers

This page was built for publication: Counting complexity classes for numeric computations II