Related papers: Equations over Finite Monoids with Infinite Promis…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
Constraint satisfaction problems (CSPs) for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might exhibit a complexity dichotomy, P versus NP-complete. A powerful method to…
We leverage path differentiability and a recent result on nonsmooth implicit differentiation calculus to give sufficient conditions ensuring that the solution to a monotone inclusion problem will be path differentiable, with formulas for…
In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…
The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…
We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…
Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
The problem of resolution of singularities in positive characteristic can be reformulated as follows: Fix a hypersurface $X$, embedded in a smooth scheme, with points of multiplicity at most $n$. Let an $n$-sequence of transformations of…
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…
We show here that molecular resolution is inherently hybrid in terms of relative separation: If molecules are close to each other, they must be characterized by a fine-grained (geometrically detailed) model, yet if molecules are far from…
Based on the monoid classifier, we give an alternative axiomatization of Freyd's paracategories, which can be interpreted in any bicategory of partial maps. Assuming furthermore a free-monoid monad T in our ambient category, and…
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…
We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. The class contains for example the rooted triple consistency problem, forbidden subtree problems, the quartet…