@InProceedings{khaniki:LIPIcs.CCC.2022.17,
author = {Khaniki, Erfan},
title = {{Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.17},
URN = {urn:nbn:de:0030-drops-165799},
doi = {10.4230/LIPIcs.CCC.2022.17},
annote = {Keywords: Proof complexity, Bounded arithmetic, Bounded depth Frege, Nisan-Wigderson generators, Meta-complexity, Lower bounds}
}