Bounded Arithmetic, Proof Complexity and TwoPapers of Parikh Export

@misc{citeulike:3361481, abstract = {This article surveys R. Parikh\&\#039;s work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh\&\#039;s papers on these subjects and some of the subsequent progress in the areas of feasible arithmetic and lengths of proofs. 1}, author = {Buss, Samuel R.}, citeulike-article-id = {3361481}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.2451}, keywords = {bounded-arithmetic, copy, print}, posted-at = {2008-10-01 07:25:27}, priority = {2}, title = {Bounded Arithmetic, Proof Complexity and TwoPapers of Parikh}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.2451} }

TY - ELEC ID - citeulike:3361481 L3 - citeulike-article-id:3361481 N2 - 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 TI - Bounded Arithmetic, Proof Complexity and TwoPapers of Parikh KW - bounded-arithmetic KW - copy KW - print AU - Buss, Samuel UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.2451 ER -