5.7k citations
- Canadian Institute for Theoretical AstrophysicsCA50 papers
- Centre National de la Recherche ScientifiqueFR31 papers
- University of British ColumbiaCA29 papers
- University of OxfordGB28 papers
- University of ChicagoUS24 papers
- McGill UniversityCA22 papers
- University of California, BerkeleyUS22 papers
- University of Wisconsin–MadisonUS21 papers
- California Institute of TechnologyUS20 papers
- Fermi National Accelerator LaboratoryUS20 papers
- Johns Hopkins UniversityUS20 papers
- The Ohio State UniversityUS18 papers
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2007★ 7 cited
Differential Recursion and Differentially Algebraic Functions
Akitoshi Kawamura
Moore introduced a class of real-valued "recursive" functions by analogy with Kleene's formulation of the standard recursive functions. While his concise definition inspired a new…
cs.CC2006
On the Computational Complexity of Defining Sets
Hamed Hatami, Hossein Maserrat
Suppose we have a family of sets. For every , a set is a {\sf defining set} for if is the only element of th…
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…