DeepAI AI Chat
Log In Sign Up

Notes on switching lemmas

by   Neil Thapen, et al.
Akademie věd ČR

We prove three switching lemmas, for random restrictions for which variables are set independently; for random restrictions where variables are set in blocks (both due to Hastad [Hastad 86]); and for a distribution appropriate for the bijective pigeonhole principle [Beame et al. 94, Krajicek et al. 95]. The proofs are based on Beame's version [Beame 94] of Razborov's proof of the switching lemma in [Razborov 93], except using families of weighted restrictions rather than families of restrictions which are all the same size. This follows a suggestion of Beame in [Beame 94]. The result is something between Hastad's and Razborov's methods of proof. We use probabilistic arguments rather than counting ones, in a similar way to Hastad, but rather than doing induction on the terms in our formula with an inductive hypothesis involving conditional probability, as Hastad does, we explicitly build one function to bound the probabilities for the whole formula.


page 1

page 2

page 3

page 4


On bounded depth proofs for Tseitin formulas on the grid; revisited

We study Frege proofs using depth-d Boolean formulas for the Tseitin con...

Shrinkage under Random Projections, and Cubic Formula Lower Bounds for 𝐀𝐂^0

Håstad showed that any De Morgan formula (composed of AND, OR and NOT ga...

The weight spectrum of several families of Reed-Muller codes

We determine the weight spectrum of RM(m-3,m) for m≥ 6, of RM(m-4,m) for...

Two new families of bivariate APN functions

In this work, we present two new families of quadratic APN functions. Th...

Crooked Indifferentiability Revisited

In CRYPTO 2018, Russell et al introduced the notion of crooked indiffere...

QBF Merge Resolution is powerful but unnatural

The Merge Resolution proof system (M-Res) for QBFs, proposed by Beyersdo...

Transitivity of Subtyping for Intersection Types

The subtyping relation for intersection type systems traditionally emplo...