Sciweavers

Share
APAL
1999

Bounded Arithmetic, Proof Complexity and Two Papers of Parikh

9 years 1 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 some of the subsequent progress in the areas of feasible arithmetic and lengths of proofs.
Samuel R. Buss
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1999
Where APAL
Authors Samuel R. Buss
Comments (0)
books