This paper proves DP-completeness of Exact-3-DNP and Exact-4-DNP by reducing 3SAT to these problems.

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 proves that testing the equivalence of finite closure systems specified by implicational and intersection methods is coNP-complete.

This paper introduces an activation hierarchy and proves a Predictor-Impossibility Theorem, showing that no effective predictor family can determine all stage languages. It also establishes a slice th…

The paper provides a constructive, intuitionistically valid proof of Rice's Theorem and the Halting Problem undecidability by reducing the problem to the undecidability of Hilbert's Tenth Problem (MRD…

This paper investigates the complexity of recognizing domatically critical graphs, which are graphs with maximum dominating sets that cannot be increased by deleting any edge.

This paper generalizes the Phoa principle in synthetic domain theory to transfinite cases, introduces sobriomorphisms, and proposes a hypothetical completeness theorem.

The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…

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 proves that the satisfiability problem of existential Presburger arithmetic extended with divisibility predicates (EPAD) is PP-hard.

This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

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

The paper presents a new semantics for choreographies and a preorder relation to prove the Endpoint Projection Theorem in a modular and simpler way.

This paper proves that the minimum edge-outerplanarity of a planar graph can be computed in polynomial time.

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