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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Even many years after Marbury v. Madison, and even in the face of the spread of aggressive constitutional court review in… 
Highly Cited
2015
Highly Cited
2015
Post-retirement employment has become an increasingly important form of labor force participation for both retirees and employers… 
2013
2013
The United States Supreme Court has come under fire in recent years for its occasional references to foreign and international… 
2013
2013
We show that the class of polynomial-size branching programs can be obfuscated according to a virtual black-box notion akin to… 
Review
2008
Review
2008
ABSTRACT Internet-based psychotherapeutic interventions have been used for more than a decade, but no comprehensive review and no… 
Highly Cited
2002
Highly Cited
2002
We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and is applicable to… 
Highly Cited
1994
Highly Cited
1994
We present simplified proofs for a variety of switching lemmas. Our arguments extend recent switching lemma improvements to show… 
Highly Cited
1993
Highly Cited
1993
UNDERSTANDING AND DESIGNING DISPUTE RESOLUTION SYSTEMS. Three Approaches to Resolving Disputes: Interests, Rights, and Power… 
Highly Cited
1991
Highly Cited
1991
Geometric uncertainty is unavoidable when programming robots for physical applications. We propose a stochastic framework for… 
Highly Cited
1985
Highly Cited
1985
One goal of locally distributed systems is to facilitate resource sharing. Most current locally distributed systems, however…