1 citations · 2 across the 5 of their papers we have counts for
5 papers
Notes on space complexity of integration of computable real functions in Ko-Friedman model
Sergey V. Yakhontov
In the present paper it is shown that real function is a linear-space computable real function on interval if is a linear-space computable $C^…
FP//LINSPACE computability of Riemann zeta function in Ko-Friedman model
Sergey V. Yakhontov
In the present paper, we construct an algorithm for the evaluation of real Riemann zeta function for all real , , in polynomial time and linear space on Turing machi…
Computable real function F such that F is not polynomial time computable on [0,1]
Sergey V. Yakhontov
A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of the function on [0,1] on Turing machine but there do…
Time- and space-efficient evaluation of the complex exponential function using series expansion
Sergey V. Yakhontov
An algorithm for the evaluation of the complex exponential function is proposed which is quasi-linear in time and linear in space. This algorithm is based on a modified binary spli…
A simple algorithm for the evaluation of the hypergeometric series using quasi-linear time and linear space
Sergey V. Yakhontov
A simple algorithm with quasi-linear time complexity and linear space complexity for the evaluation of the hypergeometric series with rational coefficients is constructed. It is sh…