Average-case bit-complexity theory of real functions

DOI10.1007/978-3-319-32859-1_43zbMATH Open1460.03016OpenAlexW2404643898MaRDI QIDQ2807871FDOQ2807871

Martin Ziegler, Matthias Schröder, Florian Steinberg

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

Recommendations

• Structural average case complexity
• scientific article; zbMATH DE number 4023258
• On the average-case complexity of underdetermined functions
• Stochastic Algorithms: Foundations and Applications
• Computing over the reals: foundations for scientific computing.

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• ON THE BITS COUNTING FUNCTION OF REAL NUMBERS
• Average-case polynomial-time computability of hamiltonian dynamics

This page was built for publication: Average-case bit-complexity theory of real functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807871)