Computational complexity theory is a subfield of theoretical computer science one of whose
primary goals is to classify and compare the practical difficulty of solving problems about …

Proof systems for quantified Boolean formulas (QBFs) provide a theoretical underpinning for
the performance of important QBF solvers. However, the proof complexity of these proof …

We prove that T NC 1, the true universal first-order theory in the language containing names
for all uniform NC 1 algorithms, cannot prove that for sufficiently large n, SAT is not …

Partially Definable Forcing and Bounded Arithmetic Page 1 Partially Definable Forcing and
Bounded Arithmetic Albert Atserias ∗ Moritz Müller † July 18, 2014 Abstract We describe a …

Function complexity classes are defined as the substitution closure of finite function sets by
improving a method of elimination of concatenation recursion from function algebras …

The elementary arithmetic operations+, ⋅, ≤+,·,≤ on integers are well-known to be
computable in the weak complexity class TC 0, and it is a basic question what properties of …

Does every Boolean tautology have a short propositional-calculus proof? Here, a
propositional-calculus (ie Frege) proof is any proof starting from a set of axioms and deriving …

Reverse Complexity is a long term research program aiming at discovering the abstract,
logical principles underlying Complexity Theory, by means of a formal, reverse analysis of its …

A word is non-repetitive if it does not contain a subword of the form vv. Given a list of
alphabets L= L 1, L 2,…, L n, we investigate the question of generating non-repetitive words …

We present applicative theories of words corresponding to weak, and especially logarithmic,
complexity classes. The theories for the logarithmic hierarchy and alternating logarithmic …