Author： Grigoriev D. Karpinski M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.157, Iss.1, 1996-04, pp. : 91-99
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Computability and Complexity in Analysis
By Nerode A. Ko K. Weihrauch K.
Theoretical Computer Science, Vol. 219, Iss. 1, 1999-05 ,pp. :
Access to resources
Recommend
On approximate and algebraic computability over the real numbers
Theoretical Computer Science, Vol. 219, Iss. 1, 1999-05 ,pp. :
Efficient parallel solutions of linear algebraic circuits
Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. :
A Simple Method for Generating Additive Clustering Models with Limited Complexity
By Lee M.D.
Machine Learning, Vol. 49, Iss. 1, 2002-10 ,pp. :