Author:
Calvert Wesley,Kramer Ken,Miller Russell
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. L. Blum, F. Cucker, M. Shub, and S. Smale;Complexity and real computation(Berlin: Springer-Verlag, 1998).
2. L. Blum, M. Shub, and S. Smale; On a theory of computation and complexity over the real numbers,Bulletin of the American Mathematical Society (New Series)21 (1989), 1-46.
3. W. Calvert, K. Kramer, & R. Miller; Noncomputable functions in the Blum-Shub-Smale model, available at pages.qc.cuny.edu/simrmiller/BSSabstract.pdf and in the abstract booklet for the conferenceLogical Approaches to Barriers in Computing and Complexity(17-20 February 2010, Greifswald, Germany).
4. W. Calvert, K. Kramer, & R. Miller; The Cardinality of an Oracle in Blum-Shub-Smale Computation, Computability and Complexity in Analysis (CCA 2010)Electronic Proceedings in Theoretical Computer Science24 (2010), 56-66.
5. M.D. Fried & M. Jarden;Field Arithmetic(Berlin: Springer-Verlag, 1986).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献