Some Exact Complexity Results for Straight-Line Computations over Semirings (Q3945585)

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 3763289
Language Label Description Also known as
default for all languages
No label defined
    English
    Some Exact Complexity Results for Straight-Line Computations over Semirings
    scientific article; zbMATH DE number 3763289

      Statements

      Some Exact Complexity Results for Straight-Line Computations over Semirings (English)
      0 references
      0 references
      0 references
      1982
      0 references
      number of multiplications
      0 references
      iterated matrix multiplication
      0 references
      iterated convolution
      0 references
      permanent
      0 references
      relations among complexity classes
      0 references
      arithmetic complexity
      0 references
      convexity theory
      0 references
      Farkas lemma
      0 references
      minimax algebra
      0 references
      straight- line algorithm
      0 references
      computation of polynomials
      0 references
      algebraic complexity
      0 references

      Identifiers