Average-case bit-complexity theory of real functions
From MaRDI portal
Recommendations
Cited in
(6)- Average-case complexity without the black swans
- ON THE BITS COUNTING FUNCTION OF REAL NUMBERS
- scientific article; zbMATH DE number 1346365 (Why is no real title available?)
- Average-case polynomial-time computability of Hamiltonian dynamics
- Software testing in computable analysis
- What is a \textit{polynomial-time} computable square-integrable function?
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)