most citedUnprovability of Strong Complexity Lower Bounds in Bounded Arithmetic

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CC2023★ 1 cited

Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic

Jiatu Li, Igor Carboni Oliveira

While there has been progress in establishing the unprovability of complexity statements in lower fragments of bounded arithmetic, understanding the limits of Jeřábek's theory $APC…