Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We state a switching lemma for tests on adversarial responses involving bilinear pairings in hard groups, where the tester can… Expand
  • table 1
  • table 2
Is this relevant?
2013
2013
The simulation paradigm, introduced by Goldwasser, Micali and Rackoff, is of fundamental importance to modern cryptography. In a… Expand
  • figure 1
  • figure 2
Is this relevant?
2013
2013
We show that the class of polynomial-size branching programs can be obfuscated according to a virtual black-box notion akin to… Expand
  • figure 2
Is this relevant?
2012
2012
Citation Luna, Rafael E., Haribabu Arthanari, Hiroyuki Hiraishi, Jagpreet Nanda, Pilar Martin-Marcos, Michelle A. Markus, Barak… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and is applicable to… Expand
Is this relevant?
2003
2003
Abstract We introduce the notion of a regular quadratic equation and a regular NTQ system over a free group. We prove the results… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and is applicable to… Expand
Is this relevant?
1999
1999
This paper looks at the rich intersection between satisfiability problems and probabilistic models, opening the door for the use… Expand
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1991
1991
Geometric uncertainty is unavoidable when programming robots for physical applications. We propose a stochastic framework for… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 2.1
  • figure 3.1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
UNDERSTANDING AND DESIGNING DISPUTE RESOLUTION SYSTEMS. Three Approaches to Resolving Disputes: Interests, Rights, and Power… Expand
Is this relevant?