Bounded Arithmetic and Propositional Proof Complexity-Reference-Cited by-同舟云学术

Bounded Arithmetic and Propositional Proof Complexity

Published:1997 Issue: Volume: Page:67-121
ISSN:
Container-title:Logic of Computation
language:
Short-container-title:

Author:

Buss Samuel R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-59048-1_3.pdf

Reference52 articles.

1. J. Bennett, On Spectra, PhD thesis, Princeton University, 1962.

2. M. L. Bonet, S. R. Buss, and T. Pitassi, Are there hard examples for Frege systems?, in Feasible Mathematics II, P. Clote and J. Remmel, eds., Boston, 1995, Birkhäuser, pp. 30-56.

3. S. R. Buss, Bounded Arithmetic, PhD thesis, Princeton University, 1985.

4. —, Bounded Arithmetic, Bibliopolis, 1986. Revision of 1985 Princeton University Ph.D. thesis.

5. — The Boolean formula value problem is in ALOGTIME, in Proceedings of the 19-th Annual ACM Symposium on Theory of Computing, May 1987, pp. 123-131.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

2. Mining the Surface: Witnessing the Low Complexity Theorems of Arithmetic;Logic, Language, Information, and Computation;2022

3. Polynomial time ultrapowers and the consistency of circuit lower bounds;Archive for Mathematical Logic;2019-06-04

4. The Scope of Gödel’s First Incompleteness Theorem;Logica Universalis;2014-11-28

5. Complexity of Propositional Proofs;Computer Science – Theory and Applications;2010