Suhail Sherif
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1
Frequent co-authors
Research Timeline
2026
The Switching Lemma shows what the Switching Lemma cannot prove: an unconditional natural-proofs barrier
This paper establishes an unconditional barrier for AC0-natural proofs, showing that they cannot prove lower bounds greater than $2^{n^{7/(d-5)}}$ against depth-$d$ circuits.
Highlighted terms show continued research focus across papers