Related papers: The complexity of classification problems for mode…
In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.
We analyze the bit complexity of efficient algorithms for fundamental optimization problems, such as linear regression, $p$-norm regression, and linear programming (LP). State-of-the-art algorithms are iterative, and in terms of the number…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…
Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is complete for $\Sigma^1_1$; the first…
We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and…
We prove a complete complexity classification theorem for the planar eight-vertex model. For every parameter setting in ${\mathbb C}$ for the eight-vertex model, the partition function is either (1) computable in P-time for every graph, or…
Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
We study Borel systems and continuous systems of measures, with a focus on mapping properties: compositions, liftings, fibred products and disintegration. Parts of the theory we develop can be derived from known work in the literature, and…
Counting the number of models of a Boolean formula is a fundamental problem in artificial intelligence and reasoning. Minimal models of a Boolean formula are critical in various reasoning systems, making the counting of minimal models…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally posed as questions in geometry and representation theory, (ii.)…
Let $X$ be an uncountable Polish space and let $\mathcal{I}$ be an ideal on $\omega$. A point $\eta \in X$ is an $\mathcal{I}$-limit point of a sequence $(x_n)$ taking values in $X$ if there exists a subsequence $(x_{k_n})$ convergent to…
We determine the complexity of counting models of bounded size of specifications expressed in Linear-time Temporal Logic. Counting word models is #P-complete, if the bound is given in unary, and as hard as counting accepting runs of…
We analyze the classification problem for finitely generated orderable groups from the viewpoint of descriptive set theory. We analyze the standard Borel space of finitely generated left-orderable groups, and the subspace of finitely…
In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…
In our previous work arXiv:1306.1770, we found all Borel-Schur algebra of finite representation type. In the present article, we determine which Borel-Schur algebras of infinite representation type are tame, and which are wild.