Add to ORKGOffers a self-contained work presenting basic ideas, classical results, current state of the art and possible future directions in proof complexity
Proof complexity can be a tool for studying the efficiency of algorithms. By proving a single lower ...
This paper is intended as an informal and accessible survey of proof complexity for non-experts, foc...
This book is about two topics on the borderline between logic and complexity theory, and in particul...
The study of proof complexity was initiated in [Cook and Reckhow 1979] as a way to attack the P vs.N...
A possibly unexpected by-product of the mathematical study of the lengths of proofs, as is done in t...
This note, based on my 4ecm lecture, exposes few basic points of proof complexity in a way accessibl...
Propositional proof complexity is the study of the lengths of propositional proofs in various differ...
A biased, incomplete high-level survey of progress in proof complexity over the last two decades. Th...
This thesis is dedicated to the study of the relations between uniform and nonuniform proof complexi...
A treatise on bounded arithmetic and propositional proof complexity by the leader in the field
ropositional proof complexity is the study of the resources that are needed to prove formulas in pro...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
What is a proof for? What is the characteristic use of a proof as a computation, as opposed to its u...
A growing number of results in proof complexity rely on so-called "lifting" techniques (also called ...
Proof complexity can be a tool for studying the efficiency of algorithms. By proving a single lower ...
This paper is intended as an informal and accessible survey of proof complexity for non-experts, foc...
This book is about two topics on the borderline between logic and complexity theory, and in particul...
The study of proof complexity was initiated in [Cook and Reckhow 1979] as a way to attack the P vs.N...
A possibly unexpected by-product of the mathematical study of the lengths of proofs, as is done in t...
This note, based on my 4ecm lecture, exposes few basic points of proof complexity in a way accessibl...
Propositional proof complexity is the study of the lengths of propositional proofs in various differ...
A biased, incomplete high-level survey of progress in proof complexity over the last two decades. Th...
This thesis is dedicated to the study of the relations between uniform and nonuniform proof complexi...
A treatise on bounded arithmetic and propositional proof complexity by the leader in the field
ropositional proof complexity is the study of the resources that are needed to prove formulas in pro...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
What is a proof for? What is the characteristic use of a proof as a computation, as opposed to its u...
A growing number of results in proof complexity rely on so-called "lifting" techniques (also called ...
Proof complexity can be a tool for studying the efficiency of algorithms. By proving a single lower ...
This paper is intended as an informal and accessible survey of proof complexity for non-experts, foc...
This book is about two topics on the borderline between logic and complexity theory, and in particul...