50 citations · 60 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2005★ 50 cited
Computing over the Reals: Foundations for Scientific Computing
Mark Braverman, Stephen Cook
We give a detailed treatment of the ``bit-model'' of computability and complexity of real functions and subsets of R^n, and argue that this is a good way to formalize many problems…
cs.CC2005★ 6 cited
On the Complexity of Real Functions
Mark Braverman
We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function…