We prove the first unconditional consistency result for superpolynomial
...
We study the power of the bounded-width consistency algorithm in the con...
A classical result by Lovász asserts that two graphs G and H are
isomorp...
Since the early days of relational databases, it was realized that acycl...
We prove that for k ≪√(n) regular resolution requires length
n^Ω(k) to e...
In several different settings, one comes across situations in which the
...
We show that the problem of finding a Resolution refutation that is at m...
We consider families of symmetric linear programs (LPs) that decide a
pr...
We show that if a system of degree-k polynomial inequalities on n Boolea...
We consider the hardness of approximation of optimization problems from ...
We introduce a new way of composing proofs in rule-based proof systems t...
The ellipsoid method is an algorithm that solves the (weak) feasibility ...
We analyse how the standard reductions between constraint satisfaction
p...
Relational joins are at the core of relational algebra, which in turn is...
We offer a new understanding of some aspects of practical SAT-solvers th...