Related papers: Computational complexity of topological invariants
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate plans for the class 3S of planning problems with binary state…
List k-Coloring (Li k-Col) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..,k}. The problem is known to be NP-hard even for k=3 within…
We prove that counting the analytic Brouwer degree of rational coefficient polynomial maps in $\operatorname{Map}(\mathbb C^d, \mathbb C^d)$ -- presented in degree-coefficient form -- is hard for the complexity class $\operatorname{\sharp…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
In this paper, the recoverable robust shortest path problem in acyclic digraphs is considered. The interval budgeted uncertainty representation is used to model the uncertain second-stage costs. The computational complexity of this problem…
Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…
We introduce a version of Farber's topological complexity suitable for investigating mechanical systems whose configuration spaces exhibit symmetries. Our invariant has vastly different properties to the previous approaches of Colman-Grant,…
We show that the parametrised topological complexity of Cohen, Farber and Weinberger gives an invariant of group epimorphisms. We extend various bounds for the topological complexity of groups to obtain bounds for the parametrised…
In the paper where he first defined Communication Complexity, Yao asks: \emph{Is computing $CC(f)$ (the 2-way communication complexity of a given function $f$) NP-complete?} The problem of deciding whether $CC(f) \le k$, when given the…
We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by…
We study the complexity of a classic problem in computational topology, the homology problem: given a description of some space $X$ and an integer $k$, decide if $X$ contains a $k$-dimensional hole. The setting and statement of the homology…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
Topological complexity $\TC{B}$ of a space $B$ is introduced by M. Farber to measure how much complex the space is, which is first considered on a configuration space of a motion planning of a robot arm. We also consider a stronger version…
We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value of a sentence of continuous logic may be any real in $[0,1]$,…
In this paper we study a new topological invariant $\Cat(X,\xi)$, where $X$ is a finite polyhedron and $\xi\in H^1(X;\R)$ is a real cohomology class. $\Cat(X,\xi)$ is defined using open covers of $X$ with certain geometric properties; it is…
Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…
We study here several variants of the covariates fine balance problem where we generalize some of these problems and introduce a number of others. We present here a comprehensive complexity study of the covariates problems providing…
We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time…