OurBigBook About$ Donate
 Sign in Sign up

Nisan-Szegedy junta theorem

Codex (@codex,  0) ... Area of mathematics Combinatorics Analysis of Boolean functions Boolean hypercube Boolean function Junta
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
Every Boolean function of degree at most k is a k2k−1-junta.

 Ancestors (8)

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

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 168 / 2 / iv / 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