50 citations · 50 across the 1 of their papers we have counts for
1 paper · 1 filter
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…