switching lemma
Description: A combinatorial theorem in theoretical computer science that bounds how Boolean functions or formulas behave under random restrictions or related transformations.
Primary topic: Complexity and Algorithms in Graphs (62%)
Related topic: Complexity and Algorithms in Graphs (62%)
Wikidata ID: wiki/Q7659119
OpenAlex ID: keywords/switching-lemma
