The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.

The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.

This paper studies the decidability and complexity properties of unary three-way and two-way deterministic and nondeterministic two-dimensional automata.

The paper studies properties of parity based bit-counting complexity classes B|0|⊕P and B|1|⊕P, proves inclusions and closures, and shows they contain PH and are contained in CH.

This paper provides bounds on the neighborhood complexity of graphs with bounded treewidth and pathwidth, and constructs reaching these bounds.

This paper shows that the λBLL calculus can accurately capture polytime computations used in cryptography.

The paper studies the meta-mathematics of algebraic circuit lower bounds and their relationship with proof systems and bounded arithmetic theories.

This paper studies the complexity of the bi-infinite Post Correspondence Problem with respect to the arithmetical hierarchy.

This paper studies the structural expressivity and parameterized complexity of counting homomorphisms from small temporal patterns to large temporal graphs, proving a temporal Lovász-style theorem, in…

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

This paper studies the properties of adjunction-universal machines and their implications on time-bounded Kolmogorov complexity.

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…