scientific article; zbMATH DE number 1257074

From MaRDI portal
Publication:4228729





\textit{L. Blum}, \textit{M. Shub} and \textit{S. Smale} [Bull. Am. Math. Soc. 21, 1-46 (1989; Zbl 0681.03020)] gave definitions of complexity for work with real numbers. The present paper carries this forward to parallel computation. Several propositions are proved by giving detailed algorithms. In the Boolean case no separations are known for the chain of complexity classes. Here some strict inclusions are known, and one is given explicitly. For the entire collection see [Zbl 0901.00033].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228729)