Average-Case Bit-Complexity Theory of Real Functions

DOI10.1007/978-3-319-32859-1_43zbMath1460.03016OpenAlexW2404643898MaRDI QIDQ2807871

Martin Ziegler, Florian Steinberg, Matthias Schröder

Publication date: 25 May 2016

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_43

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computation over the reals, computable analysis (03D78)

Related Items (1)

Average-case polynomial-time computability of hamiltonian dynamics

This page was built for publication: Average-Case Bit-Complexity Theory of Real Functions