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… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Benjamin Rossman
- 2017

We show that every m-clause DNF F satisfies P[ DTdepth(F Rp) ≥ t ] = O(p log(m+ 1)) where Rp is the p-random restriction and… (More)

Is this relevant?

2016

2016

We show that any polynomial-size Frege refutation of a certain linear-size unsatisfiable 3-CNF formula over <i>n</i> variables… (More)

Is this relevant?

2015

2015

- Boaz Barak, Chiheon Kim
- 2015

Why do we care about random oracles? It goes back to computability theory. Many results including halting problems, R vs RE, and… (More)

Is this relevant?

2013

2013

- Charanjit S. Jutla, Arnab Roy
- CRYPTO
- 2013

We state a switching lemma for tests on adversarial responses involving bilinear pairings in hard groups, where the tester can… (More)

Is this relevant?

2012

2012

- Luca Trevisan, Tongke Xue
- 2013 IEEE Conference on Computational Complexity
- 2012

We describe a new pseudorandom generator for AC0. Our generator ε-fools circuits of depth d and size M and uses a seed of… (More)

Is this relevant?

2009

2009

- Neil Thapen
- 2009

We prove three switching lemmas, for random restrictions for which variables are set independently; for random restrictions where… (More)

Is this relevant?

2008

2008

- Donghoon Chang, Mridul Nandi
- IACR Cryptology ePrint Archive
- 2008

In Eurocrypt 2006, Bellare and Rogaway [2] gave a proof of the PRP/PRF switching Lemma using their game-based proof technique. In… (More)

Is this relevant?

Review

2005

Review

2005

- Victor L. Chen
- 2005

Today we show that PARITY is not in AC0. AC0 is a family of circuits with constant depth, polynomial size, and unbounded fan-in… (More)

Is this relevant?

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… (More)

Is this relevant?

1993

1993

- Sorin Istrail, Dejan Zivkovic
- STACS
- 1993

Abs t r ac t . Valiant [12] showed that the clique function is structurally different than the majority function by establishing… (More)

Is this relevant?