Subject
General Computer Science,Theoretical Computer Science
Reference41 articles.
1. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines;Blum;Bull. Amer. Math. Soc.,1989
2. Theory of Sets;Bourbaki,1974
3. Computable selection in analysis;Brattka,1995
4. Continuity and Computability of relations;Brattka,1994
5. Feasible real random access machines;Brattka,1995
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献