Add to ORKGii Consider the following variant of quantified propositional logic. A new, parallel extension rule is introduced. This rule is aware of inde-pendence of the introduced variables. The obtained calculus has the property that heights of derivations correspond to heights of Boolean circuits. Adding an uninterpreted predicate on bit-strings, akin to an oracle in relativised complexity classes, this statement can be made precise. Consider proofs of the statement that a given circuit can be evaluated. The most shallow of these proofs in the said calculus has a height that is, up to an additive constant, the height of the circuit considered. The main tool for showing lower bounds on proof heights is a vari-ant of an iteration principle studied by ...
As the title indicates, this thesis is concerned with the strength of non-uniformity in proof comple...
It is shown that the time needed by a concurrent-read, concurrentwrite parallel random access machin...
Based on the concept of pseudorandom generators, the notation of a generator which is hard for a pro...
Abstract. By introducing a parallel extension rule that is aware of inde-pendence of the introduced ...
[[abstract]]In this paper, the divide-and-conquer strategy and a pipelining discipline are applied t...
We introduce and study counting propositional logic, an extension of propositional logic with counti...
We present and study a framework in which one can present alternation-based lower bounds on proof le...
We present and study a framework in which one can present alternation-based lower bounds on proof le...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
AbstractWe analyze the computational complexity of determining whether F is satisfiable when F is a ...
It is well known that the Boolean functions corresponding to a function computable in polynomial tim...
Quantified Boolean Formulas (QBF) and their proof complexity are not as well understood as proposit...
A possibly unexpected by-product of the mathematical study of the lengths of proofs, as is done in t...
We prove lower bounds of the form exp (n " d ) ; " d ? 0; on the length of proofs of an ...
We define and investigate Frege systems for quantified Boolean formulas (QBF). For these new proof s...
As the title indicates, this thesis is concerned with the strength of non-uniformity in proof comple...
It is shown that the time needed by a concurrent-read, concurrentwrite parallel random access machin...
Based on the concept of pseudorandom generators, the notation of a generator which is hard for a pro...
Abstract. By introducing a parallel extension rule that is aware of inde-pendence of the introduced ...
[[abstract]]In this paper, the divide-and-conquer strategy and a pipelining discipline are applied t...
We introduce and study counting propositional logic, an extension of propositional logic with counti...
We present and study a framework in which one can present alternation-based lower bounds on proof le...
We present and study a framework in which one can present alternation-based lower bounds on proof le...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
AbstractWe analyze the computational complexity of determining whether F is satisfiable when F is a ...
It is well known that the Boolean functions corresponding to a function computable in polynomial tim...
Quantified Boolean Formulas (QBF) and their proof complexity are not as well understood as proposit...
A possibly unexpected by-product of the mathematical study of the lengths of proofs, as is done in t...
We prove lower bounds of the form exp (n " d ) ; " d ? 0; on the length of proofs of an ...
We define and investigate Frege systems for quantified Boolean formulas (QBF). For these new proof s...
As the title indicates, this thesis is concerned with the strength of non-uniformity in proof comple...
It is shown that the time needed by a concurrent-read, concurrentwrite parallel random access machin...
Based on the concept of pseudorandom generators, the notation of a generator which is hard for a pro...