No label defined (Q4788068)

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 1855658
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1855658

      Statements

      0 references
      19 January 2003
      0 references
      complexity
      0 references
      Boolean function
      0 references
      lower bound
      0 references
      basis
      0 references
      formula
      0 references
      Let \(f(x_1,\dots,x_n)\) and \(g(x_1,\dots,x_m)\) be Boolean functions. A function \[ (f\otimes g)(x_1,\dots,x_{nm})= f\bigl(g(x_1,\dots,x_m),\dots,g(x_{(n-1)m+1},\dots,x_{nm})\bigr) \] is called a repetition-free product of Boolean functions. A criterion is given that makes it possible to check whether a sequence of products of Boolean functions can be computed with linear size formulas in a basis \(B\).
      0 references

      Identifiers