Skip to search formSkip to main contentSkip to account menu

Switching lemma

Known as: Håstad's Switching Lemma 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
AC0Computational complexity theoryConjunctive normal formDecision tree

Broader (1)

Circuit complexity

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2022
2022
Notes on switching lemmas
We prove three switching lemmas, for random restrictions for which variables are set independently; for random restrictions where… 
2018
2018
Resolution with Counting: Lower Bounds over Different Moduli
Resolution over linear equations (introduced in [RT08]) emerged recently as an important object of study. This refutation system… 
2017
2017
Of Unreasonable Searches and Seizures: A Blueprint for a Constitutional Challenge to the Security of Canada Information Sharing Act
This thesis scrutinizes the Security of Canada Information Sharing Act [“SoCIS”] through the lens of section 8 of the Charter of… 
Review
2016
Review
2016
Improved and derandomized parallel algorithms for hypergraph maximal independent set
A parallel algorithm for finding a maximal independent set in hypergraphs has been a longstanding algorithmic challenge, dating… 
2010
2010
A Comparative Constitutional Analysis of the Judicial Treatment of Torture Between Israel and the United States: Navigating the Contentious Issue of Legality vs Policy in National Security Matters
2007
2007
The Puzzling Parameters of the Foreign Law Debate
This paper engages with the debate about the use of foreign law in constitutional interpretation in the United States. It… 
2007
2007
Monotone Complexity by Switching Lemma ∗
We prove a lower bound of 2 Ω ( 
1998
1998
Revisiting Effective Teaching
Participants in my workshops frequently reinforce this thought as they point out or ask about the connections between Madeline… 
1997
1997
On the Power of a Threshold Gate at the Top
1988
1988
Using a neural network to learn the dynamics of the CMU Direct-Drive Arm II
Computing the inverse dynamics of a robot arm is an active area of research in the control literature. We apply a backpropagation… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)