Recent developments in anti-de Sitter holography point towards the association of an infinite class of covariant objects, the simplest one being codimension-one extremal volumes, with quantum computational complexity in the microscopic description. O...
Arc-Kayles is a game where two players alternate removing two adjacent vertices until no move is left, the winner being the player who played the last move. Introduced in 1978, its computational complexity is still open. More recently, subtraction ga...
We study the computational complexity of strategic behaviour in primary elections. Unlike direct voting systems, primaries introduce a multi-stage process in which voters first influence intra-party nominees before a general election determines the f...
In this note, we extend the result of \cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in framework o...
This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently computable....
The original Deutsch-Jozsa (oDJ) problem is for an oracle (realized here as a database) of size N, where, according to their claim, the deterministic solution of the problem on a classical Turing computer requires O(N) computational complexity. They...
Despite the extensive literature on Tullock contests, computational results for the general model with heterogeneous contestants remain scarce. This paper studies the algorithmic complexity of computing a pure Nash Equilibrium (PNE) in such general T...
The bribery problem in election has received considerable attention in the literature, upon which various algorithmic and complexity results have been obtained. It is thus natural to ask whether we can protect an election from potential bribery. We a...
While quantum computers hold the promise of significant computational speedups, the limited size of early quantum machines motivates the study of space-bounded quantum computation. We relate the quantum space complexity of computing a function f with...
In this paper, we investigate the computational complexity of solutions to the Laplace and the diffusion equation. We show that for a certain class of initial-boundary value problems of the Laplace and the diffusion equation, the solution operator is...
We revisit the complexity of deciding, given a {\it bimatrix game,} whether it has a {\it Nash equilibrium} with certain natural properties; such decision problems were early known to be ${\mathcal{NP}}$-hard~\cite{GZ89}. We show that ${\mathcal{NP}}...
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. Secondly, we look...
We show that separating the in-phase and quadrature component in optimized, machine-learning based demappers of optical communications systems with geometric constellation shaping reduces the required computational complexity whilst retaining their g...
This paper was presented on the occasion of an honorary doctoral degree for Henryk Wozniakowski at Friedrich Schiller University in Jena, Germany on June 6, 2008. Information-based complexity (IBC) is the study of algorithms and computational compl...
We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether an invers...
We investigate the computational complexity of admissibility of inference rules in infinite-valued Łukasiewicz propositional logic (Ł). It was shown in [13] that admissibility in Ł is checkable in PSPACE. We establish that this result is optimal,...
The Grundy number of a graph is the maximum number of colors used by the greedy coloring algorithm over all vertex orderings. In this paper, we study the computational complexity of GRUNDY COLORING, the problem of determining whether a given graph ha...
We investigate the computational complexity of the empire colouring problem (as defined by Percy Heawood in 1890) for maps containing empires formed by exactly $r > 1$ countries each. We prove that the problem can be solved in polynomial time using $...
The versatility of recent machine learning approaches makes them ideal for improvement of next generation video compression solutions. Unfortunately, these approaches typically bring significant increases in computational complexity and are difficult...
This paper introduces an innovative method for reducing the computational complexity of deep neural networks in real-time speech enhancement on resource-constrained devices. The proposed approach utilizes a two-stage processing framework, employing c...