Funder
Austrian Science Fund
European Research Council
Publisher
Springer Science and Business Media LLC
Reference40 articles.
1. Avigad, J.: Saturated models of universal theories. Ann. Pure Appl. Logic 118(3), 219–234 (2002)
2. Buss, S.R.: Bounded arithmetic and propositional proof complexity. In: H. Schwichtenberg (ed.) Logic of Computation, pp. 67–122. Springer, Berlin (1997)
3. Bydžovský, J.: Powers of models in weak arithmetics. MSc. Thesis, University of Vienna, 2018.
http://dmg.tuwien.ac.at/bydzovsky/mthesis.pdf
4. Cook, S.A.: Feasibly constructive proofs and the propositional calculus. In: Proceedings of the Seventh Annual ACM Symposium on Theory of Computing (STOC), pp. 83–97. ACM, New York (1975)
5. Cook, S.A., Krajíček, J.: Consequences of the provability of NP $$\subseteq $$ P/poly. J. Symb. Logic 72(4), 1353–1371 (2007)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Consistency of Circuit Lower Bounds for Non-deterministic Time;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
5. Strong co-nondeterministic lower bounds for NP cannot be proved feasibly;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15