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 investigates the computational complexity of deterministic k-pebble automata and their relation to finite automata and Kolmogorov complexity.

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

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

This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.

The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.

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

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

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

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.

The paper introduces and explores Truly Linear FPT (TLFPT), a complexity class defined by $O(n) + f(k)$, demonstrating that it is a strict subset of standard Linear FPT and providing new algorithms fo…

This paper shows #P-completeness for several graph counting problems using a new technique.

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