Invitation Invitation Secret Secret 1 1 Algorithms Algorithms are are at at the the heart heart
of of complexity complexity theory. theory. That That is is the the dark dark secret secret of of …

We study the expressive power of fragments of inclusion and independence logic defined
either by restricting the number of universal quantifiers or the arity of inclusion and …

Different techniques have been used to prove several transference theorems of the form"
nontrivial algorithms for a circuit class C yield circuit lower bounds against C". In this survey …

I discuss recent progress in developing and exploiting connections between SAT algorithms
and circuit lower bounds. The centrepiece of the article is Williams' proof that NEXP⊈ ACC0 …

We show that" a little more time gives a lot more power to sampling algorithms." We prove
that for every constant k≥ 2, every polynomial time bound t, and every polynomially small ε …

The past decade has witnessed the development of many important declarative languages
for knowledge representation and reasoning such as answer set programming (ASP) …

In recent years, finding new satisfiability algorithms for various circuit classes has been a
very active line of research. Despite considerable progress, we are still far away from a …

Term satisfiability problem for two-element algebras is in QL or is NQL-complete Page 1 Term
satisfiability problem for two-element algebras is in QL or is NQL-complete Tomasz A. Gorazd …

There is arguably no other theoretical tool in the arsenal of the algorithm developer that is as
powerful as complexity, in its ability to compare the theoretical performance of algorithms …

We introduce a new so-called distance complexity measure for Turing machine
computations which is sensitive to long-distance transfers of information on the worktape. An …