S. Buss. Bounded arithmetic and propositional proof complexity, in Logic of Computation (H. Schwichtenberg, ed.), pp. 67--122, Springer-Verlag, 1997. math.ucsd.edu/sbuss/ResearchWeb/marktoberdorf95/index.html. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Bounded Arithmetic, Cryptography and Complexity - Buss Self-citation (Buss) (Correct)
....local search functions, plus a version of the interpolation theorem. A second and simpler method for proving this theorem was developed by him in [19] see also Kraj icek [10] which was also based on a Craig interpolation theorem. A complete proof based on Razborov s second method can be found in [3]; we omit the rather lengthy proof here, however. The obvious question at this point is what is the import of Theorem 6. Firstly, if S 2 2 (ff) could be replaced by U 1 1 (ff) this would clearly become a very strong result that would say something quite meaningful about the difficulty 10 ....
S. R. Buss, Bounded arithmetic and propositional proof complexity. To appear in the Proceedings of the NATO International Summer Schoolon Logic of Computation, held in Marktoberdorf, Germany, 1995.
Is P versus NP Formally Independent? - Aaronson (Correct)
No context found.
S. Buss. Bounded arithmetic and propositional proof complexity, in Logic of Computation (H. Schwichtenberg, ed.), pp. 67--122, Springer-Verlag, 1997. math.ucsd.edu/sbuss/ResearchWeb/marktoberdorf95/index.html.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC