<p>Sections 5 and 6.3 of Paul Beame's Switching Lemma Primer (available e.g. <a href="https://users.cs.duke.edu/%7Ereif/courses/complectures/Beame/SwitchingLemmaPrimer.pdf" rel="noreferrer">here</a>) covers the version of the switching lemma used in many proof complexity lower bounds (which is one way random restrictions are often used). It doesn't actually do the application to proof complexity, but it might still be a helpful resource.</p>

CC BY-SA 4.0
2024-11-10T16:46:59.193Z
2024-11-10T16:46:59.193Z
Joshua Grochow
<p>I am currently exploring the application of the <strong>random restriction</strong> technique in proving lower bounds within the context of resolution proofs. I would like to know if there are any comprehensive tutorials, lecture notes, or survey papers that cover this topic specifically.</p>
<p>If you have any recommendations on foundational or recent resources that discuss how random restrictions have been used to establish lower bounds in resolution proofs, I would greatly appreciate it. Any pointers to key papers, authors, or specific techniques within this area would also be incredibly helpful.</p>

<reference-request><lower-bounds><proof-complexity><resolution>
Resources or Survey Papers on Applying Random Restrictions to Resolution Proof Lower Bound Techniques
Jxb
# Resources or Survey Papers on Applying Random Restrictions to Resolution Proof Lower Bound Techniques

(Asked by: username_0 on 2024-11-10)

I am currently exploring the application of the **random restriction** technique in proving lower bounds within the context of resolution proofs. I would like to know if there are any comprehensive tutorials, lecture notes, or survey papers that cover this topic specifically.

If you have any recommendations on foundational or recent resources that discuss how random restrictions have been used to establish lower bounds in resolution proofs, I would greatly appreciate it. Any pointers to key papers, authors, or specific techniques within this area would also be incredibly helpful.

**Tags:** reference-request, lower-bounds, proof-complexity, resolution


---

## 1 answers

### Answer by username_1 on 2024-11-10. Score: 6

Sections 5 and 6.3 of Paul Beame's Switching Lemma Primer (available e.g. [here](https://users.cs.duke.edu/%7Ereif/courses/complectures/Beame/SwitchingLemmaPrimer.pdf)) covers the version of the switching lemma used in many proof complexity lower bounds (which is one way random restrictions are often used). It doesn't actually do the application to proof complexity, but it might still be a helpful resource.


---

