A property of Boolean functions is large when it contains a nonnegligible fraction, customarily at least , of all -variable Boolean functions.

Ancestors (6)

  1. Natural proof
  2. Circuit complexity
  3. Computational complexity theory
  4. Theoretical computer science
  5. Computer science
  6. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version