Computable Analysis

By Klaus Weihrauch. Conference on Computability in Europe, 2005

1,475 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Measures and Their Random Reals (2008, background): “[31], or [10], [7] in this particular context).”
Tractability of Multivariate Problems (2008, methodology): “This model, usually without oracles, is studied in the work of Ko, Schönhage, Weihrauch and others, see for instance [105, 206, 270, 271].”
Theory and Applications of Models of Computation: 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings (2019, background): “For the background on computable metric spaces, the reader is referred to [29].”
Most Tensor Problems Are NP-Hard (2009, methodology): “odel of complexity involving NP-hard [Knuth 1974a; Knuth 1974b] and NP-complete problems [Cook 1971; Karp 1972; Levin 1973], as opposed to other computational models [Valiant 1979a; Blum et al. 1989; Weihrauch 2000]. We describe our framework in Subsection 1.3 along with a comparison to other models”