Related papers: Computational complexity of topological invariants

We study probabilistic variants of the Lusternik--Schnirelmann category and topological complexity, which bound the classical invariants from below. We present a number of computations illustrating both wide agreement and wide disagreement…

Topological complexity for spaces was introduced by M. Farber as a minimal number of continuity domains for motion planning algorithms. It turns out that this notion can be extended to the case of not necessarily commutative C*-algebras.…

We show that a topological quantum computer based on the evaluation of a Witten-Reshetikhin-Turaev TQFT invariant of knots can always be arranged so that the knot diagrams with which one computes are diagrams of hyperbolic knots. The…

Let X be a (not-necessarily homotopy-associative) H-space. We show that TC_{n+1}(X) = cat(X^n), for n >= 1, where TC_{n+1}(-) denotes the so-called higher topological complexity introduced by Rudyak, and cat(-) denotes the…

This paper proves that arrangement of music is NP-hard when subject to various constraints: avoiding musical dissonance, limiting how many notes can be played simultaneously, and limiting transition speed between chords. These results imply…

We study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths and constants. This problem is known to be in EXPSPACE and…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

For a class $\mathcal{H}$ of graphs, #Sub$(\mathcal{H})$ is the counting problem that, given a graph $H\in \mathcal{H}$ and an arbitrary graph $G$, asks for the number of subgraphs of $G$ isomorphic to $H$. It is known that if $\mathcal{H}$…

The computational complexity class #P captures the difficulty of counting the satisfying assignments to a boolean formula. In this work, we use basic tools from quantum computation to give a proof that the SO(3) Witten-Reshetikhin-Turaev…

Matrix permanents arise naturally in the context of linear optical networks fed with nonclassical states of light. In this letter we tie the computational complexity of a class of multi-dimensional integrals to the permanents of large…

The Lichtenbaum-Quillen conjecture for smooth complex varieties states that algebraic and topological K-theory with finite coefficients become isomorphic in high degrees. We define the "Lichtenbaum-Quillen dimension" of a variety in terms…

In an article [3] published recently in this journal, it was shown that when k >= 3, the problem of deciding whether the distinguishing chromatic number of a graph is at most k is NP-hard. We consider the problem when k = 2. In regards to…

We consider the homeomorphic classification of finite-dimensional continua as well as several related equivalence relations. We show that, when $n \geq 2$, the classification problem of $n$-dimensional continua is strictly more complex than…

We prove the discrete Lusternik-Schnirelmann theorem telling that tcat(G) less or equal to crit(G) for a general simple graph G=(V,E). It relates the minimal number tcat(G) of in G contractible graphs covering G, with crit(G), the minimal…

We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…

Topological complexity was first introduced in 2003 by Michael Farber as a homotopy invariant for a connected topological space X, denoted by TC(X). Although the invariant is defined in terms of elementary homotopy theory using well-known…

This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…

By analogy with the invariant Q-category defined by Scheerer, Stanley and Tanr\'e, we introduce the notions of Q-sectional category and Q-topological complexity. We establish several properties of these invariants. We also obtain a formula…

The Weisfeiler-Leman dimension of a graph $G$ is the least number $k$ such that the $k$-dimensional Weisfeiler-Leman algorithm distinguishes $G$ from every other non-isomorphic graph. The dimension is a standard measure of the descriptive…

By a formula of Farber the topological complexity TC(X) of a (p-1)-connected, m-dimensional CW-complex X is bounded above by (2m+1)/p+1. There are also various lower estimates for TC(X) such as the nilpotency of the ring $H^*(X\times…