34 citations · 54 across the 14 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.CC2017
Parametrised second-order complexity theory with applications to the study of interval computation
Eike Neumann, Florian Steinberg
We extend the framework for complexity of operators in analysis devised by Kawamura and Cook (2012) to allow for the treatment of a wider class of representations. The main novelty…
cs.CG2017
On the computability of the Fréchet distance of surfaces in the bit-model of real computation
Eike Neumann
We show that the Fréchet distance of two-dimensional parametrised surfaces in a metric space is computable in the bit-model of real computation. An analogous result in the real RAM…
cs.CC2017
Representations and evaluation strategies for feasibly approximable functions
Michal Konečný, Eike Neumann
A famous result due to Ko and Friedman (1982) asserts that the problems of integration and maximisation of a univariate real function are computationally hard in a well-defined sen…