No label defined (Q4228729)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1257074
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1257074

      Statements

      0 references
      0 references
      0 references
      1 March 1999
      0 references
      complexity
      0 references
      real numbers
      0 references
      parallel computation
      0 references
      algorithms
      0 references
      complexity classes
      0 references
      \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].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references