The following pages link to Florian Steinberg (Q831998):
Displaying 18 items.
- Exact real computation of solution operators for linear analytic systems of partial differential equations (Q832000) (← links)
- Comparing representations for function spaces in computable analysis (Q1635809) (← links)
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving (Q1799286) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Second-order linear-time computability with applications to computable analysis (Q2327485) (← links)
- Average-Case Bit-Complexity Theory of Real Functions (Q2807871) (← links)
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis (Q3188250) (← links)
- On the computational complexity of the Dirichlet Problem for Poisson's Equation (Q4593239) (← links)
- Complexity Theory of (Functions on) Compact Metric Spaces (Q4635948) (← links)
- (Q4989411) (← links)
- Continuous and monotone machines (Q5089226) (← links)
- Polynomial Running Times for Polynomial-Time Oracle Machines (Q5111319) (← links)
- Bounded time computation on metric spaces and Banach spaces (Q5144686) (← links)
- (Q5272527) (← links)
- (Q5367060) (← links)
- Representations of Analytic Functions and Weihrauch Degrees (Q5740198) (← links)
- Quantitative continuity and Computable Analysis in Coq (Q5875440) (← links)
