APAL   1999
Wall of Fame | Most Viewed APAL-1999 Paper
120views more  APAL 1999»
8 years 10 months ago
Bounded Arithmetic, Proof Complexity and Two Papers of Parikh
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 s...
Samuel R. Buss
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source120
2Download preprint from source97
3Download preprint from source90
4Download preprint from source88
5Download preprint from source79
6Download preprint from source74
7Download preprint from source72
8Download preprint from source70
9Download preprint from source68
10Download preprint from source62
11Download preprint from source55
12Download preprint from source50