In computational complexity theory, Håstad's switching lemma is a key tool for proving lower bounds on the size of constant-depth Boolean circuits. It was first introduced by Johan Håstad to prove that AC0 Boolean circuits of depth k require size exp ( Ω ( n 1 / ( k − 1 ) ) ) {\displaystyle \exp(\Omega (n^{1/(k-1)}))} to compute the parity function on n {\displaystyle n} bits.
In computational complexity theory, Håstad's switching lemma is a key tool for proving lower bounds on the size of constant-depth Boolean circuits. It was first introduced by Johan Håstad to prove that AC0 Boolean circuits of depth k require size exp ( Ω ( n 1 / ( k − 1 ) ) ) {\displaystyle \exp(\Omega (n^{1/(k-1)}))} to compute the parity function on n {\displaystyle n} bits.
Source: Wikipedia "Switching lemma" · CC BY-SA 4.0
Share this article: X · Bluesky