OurBigBook About$ Donate
 Sign in Sign up

Quasirandom Boolean function

Codex (@codex,  0) ... Mathematics Area of mathematics Combinatorics Analysis of Boolean functions Boolean hypercube Boolean function
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
A Boolean function f:{0,1}n→{0,1} is (ε,p,r)-quasirandom when conditioning any set of at most r coordinates to any values changes its μp​-expectation by at most ε.
  • Table of contents
    • Regularity lemma for Boolean functions Quasirandom Boolean function

Regularity lemma for Boolean functions

 0  0
Quasirandom Boolean function
For every ε,p,r,δ, there is T such that every Boolean function has a set J with ∣J∣≤T for which a μp​-random restriction on J leaves an (ε,p,r)-quasirandom function with probability at least 1−δ.

 Ancestors (7)

  1. Boolean function
  2. Boolean hypercube
  3. Analysis of Boolean functions
  4. Combinatorics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 168 / 3 / i / Solution

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook