Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds

Erfan Khaniki. Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds. In Shachar Lovett, editor, 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA. Volume 234 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Abstract

Abstract is missing.