Complexity lower bounds for randomized computation trees over zero characteristic fields (Q1587344)

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 1533077
Language Label Description Also known as
default for all languages
No label defined
    English
    Complexity lower bounds for randomized computation trees over zero characteristic fields
    scientific article; zbMATH DE number 1533077

      Statements

      Complexity lower bounds for randomized computation trees over zero characteristic fields (English)
      0 references
      0 references
      6 February 2001
      0 references
      nonlinear complexity lower bounds
      0 references
      randomized computation trees
      0 references

      Identifiers