On the Consistency of Circuit Lower Bounds for Non-deterministic Time-Reference-Cited by-同舟云学术

On the Consistency of Circuit Lower Bounds for Non-deterministic Time

Published:2023-06-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 55th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Atserias Albert¹,Buss Sam²,Müller Moritz³

Affiliation:

1. Universitat Politècnica de Catalunya, Spain / Centre de Recerca Matemàtica, Spain

2. University of California at San Diego, San Diego, USA

3. University of Passau, Germany

Funder

Agencia Estatal de Investigación

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3564246.3585253

Reference37 articles.

1. The complexity of the pigeonhole principle

2. A. Atserias , M. Müller . Partially definable forcing and bounded arithmetic. Archive for Mathematical Logic 54 ( 1 ): 1-33 , 2015 . A. Atserias, M. Müller. Partially definable forcing and bounded arithmetic. Archive for Mathematical Logic 54 ( 1 ): 1-33, 2015.

3. P. Beame , R. Impagliazzo , J. Krajíček , T. Pitassi , P. Pudlák , A. Woods . Exponential lower bound for the pigeonhole principle (extended abstract) . Proceedings of the ACM Symposium on Theory of Computing (STOC'92) , ACM Press , pp. 200 - 220 , 1992 . P. Beame, R. Impagliazzo, J. Krajíček, T. Pitassi, P. Pudlák, A. Woods. Exponential lower bound for the pigeonhole principle (extended abstract). Proceedings of the ACM Symposium on Theory of Computing (STOC'92), ACM Press, pp. 200-220, 1992.

4. A. Beckmann , S. R. Buss . Improved witnessing and local improvement principles for second-order bounded arithmetic. ACM Transactions on Computational Logic 15 ( 1 ) : Article 2 , 2014 . A. Beckmann, S. R. Buss. Improved witnessing and local improvement principles for second-order bounded arithmetic. ACM Transactions on Computational Logic 15 ( 1 ): Article 2, 2014.

5. S. R. Buss. Bounded Arithmetic. Bibliopolis Naples 1986. S. R. Buss. Bounded Arithmetic. Bibliopolis Naples 1986.