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…

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

This paper constructs unambiguous DNFs with width O(n) and Ω(n^2) 0-certificate complexity, and proves a lifting theorem to communicate the separation in certificate complexity to communication comple…

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

This paper connects a generalized notion of tensor rank with multiplicative complexity, enabling control of arithmetic complexity in any constant degree of multilinearity and applications to fine-grai…

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.

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

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

The authors verify the replication conjecture for cuboids of degree at most 9 and clutters over at most 10 elements.

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…

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

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

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 studies the complexity of the bi-infinite Post Correspondence Problem with respect to the arithmetical hierarchy.

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…