Please help support CiteULike by taking part in our survey.
CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Bounded Arithmetic, Proof Complexity and TwoPapers of Parikh

by: Samuel R. Buss

X Abstract

This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh's papers on these subjects and some of the subsequent progress in the areas of feasible arithmetic and lengths of proofs. 1

View the full article here:

CiteSeerX Beta

This article has been bookmarked once, on 2008-10-01.

2008-10-01 User yoriyuki
Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.