Add to ORKGThis 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
It is well-known that theories of Bounded Arithmetic are closely related to propositional proof syst...
A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space res...
Offers a self-contained work presenting basic ideas, classical results, current state of the art and...
AbstractThis article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity ...
This book is about two topics on the borderline between logic and complexity theory, and in particul...
A treatise on bounded arithmetic and propositional proof complexity by the leader in the field
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing...
This survey discusses theories of bounded arithmetic, growth rates of definable functions, natural p...
The study of proof complexity was initiated in [Cook and Reckhow 1979] as a way to attack the P vs.N...
Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I...
A possibly unexpected by-product of the mathematical study of the lengths of proofs, as is done in t...
This thesis is dedicated to the study of the relations between uniform and nonuniform proof complexi...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
AbstractIn this paper we prove some results about the complexity of proofs. We consider proofs in Hi...
Title: Complexity Theory in Feasible Mathematics Author: Ján Pich Department: Department of Algebra ...
It is well-known that theories of Bounded Arithmetic are closely related to propositional proof syst...
A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space res...
Offers a self-contained work presenting basic ideas, classical results, current state of the art and...
AbstractThis article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity ...
This book is about two topics on the borderline between logic and complexity theory, and in particul...
A treatise on bounded arithmetic and propositional proof complexity by the leader in the field
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing...
This survey discusses theories of bounded arithmetic, growth rates of definable functions, natural p...
The study of proof complexity was initiated in [Cook and Reckhow 1979] as a way to attack the P vs.N...
Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I...
A possibly unexpected by-product of the mathematical study of the lengths of proofs, as is done in t...
This thesis is dedicated to the study of the relations between uniform and nonuniform proof complexi...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
AbstractIn this paper we prove some results about the complexity of proofs. We consider proofs in Hi...
Title: Complexity Theory in Feasible Mathematics Author: Ján Pich Department: Department of Algebra ...
It is well-known that theories of Bounded Arithmetic are closely related to propositional proof syst...
A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space res...
Offers a self-contained work presenting basic ideas, classical results, current state of the art and...