Related papers: Measuring the Complexity of Countable Presburger M…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
We survey classical and recent developments in numerical linear algebra, focusing on two issues: computational complexity, or arithmetic costs, and numerical stability, or performance under roundoff error. We present a brief account of the…
The computational complexity of a Delta 2 set will be calibrated by the amount of changes needed for any of its computable approximations. Firstly, we study Martin-Loef random sets, where we quantify the changes of initial segments.…
Separations among the first order logic ${\cal R}ing(0,+,*)$ of finite residue class rings, its extensions with generalized quantifiers, and in the presence of a built-in order are shown, using algebraic methods from class field theory.…
Presburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be…
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
Faraday complexity describes whether a spectropolarimetric observation has simple or complex magnetic structure. Quickly determining the Faraday complexity of a spectropolarimetric observation is important for processing large, polarised…
We prove that if $A$ is a computable Hopfian finitely presented structure, then $A$ has a computable $d$-$\Sigma_2$ Scott sentence if and only if the weak Whitehead problem for $A$ is decidable. We use this to infer that every hyperbolic…
The model checking problem for various fragments of first-order logic has attracted much attention over the last two decades: in particular, for the primitive positive and the positive Horn fragments, which are better known as the…
We consider the sensitivity of real roots of polynomial systems with respect to perturbations of the coefficients. In particular - for a version of the condition number defined by Cucker, Krick, Malajovich, and Wschebor - we establish new…
We calculate the spectral weight of the one- and two-dimensional Hubbard models, by performing exact diagonalizations of finite clusters and treating inter-cluster hopping with perturbation theory. Even with relatively modest clusters (e.g.…
How to measure the complexity of a finite set of vectors embedded in a multidimensional space? This is a non-trivial question which can be approached in many different ways. Here we suggest a set of data complexity measures using universal…
We give a summary on spectral techniques for finite dimensional algebras and study its link to singularity theory. In particular, we offer a contribution to the categorification of the Milnor lattice of two-dimensional singularities through…
We study the data complexity of model-checking for logics with team semantics. We focus on dependence, inclusion, and independence logic formulas under both strict and lax team semantics. Our results delineate a clear…
Recent works have explored the use of counting queries coupled with Description Logic ontologies. The answer to such a query in a model of a knowledge base is either an integer or $\infty$, and its spectrum is the set of its answers over…
Often a screening or selection experiment targets a cell or tissue, which presents many possible molecular targets and identifies a correspondingly large number of ligands. We describe a statistical method to extract an estimate of the…
We examine the computational complexity of testing and finding small plans in probabilistic planning domains with both flat and propositional representations. The complexity of plan evaluation and existence varies with the plan type sought;…
We study inert, and ambiguous conjugacy classes in the modular group $\mathrm{PSL}(2,\mathbb{Z})$ from a purely combinatorial perspective. Using word length in the free product representation $\mathbb{Z}_2 * \mathbb{Z}_3$ of the modular…
The spectrum $\omega(G)$ is the set of orders of elements of $G$. We consider the problem of generating the spectrum of a finite nonabelian simple group $G$ given by the degree of $G$ if $G$ is an alternating group, or the Lie type, Lie…