Related papers: Spaces With Complexity One
As in the case of the associahedron and cyclohedron, the permutohedron can also be defined as an appropriate compactification of a configuration space of points on an interval or on a circle. The construction of the compactification endows…
The work is concerned with the trade-offs between the dimension and the time and space complexity of computations on nondeterministic cellular automata. It is proved, that 1). Every NCA $\Cal A$ of dimension $r$, computing a predicate $P$…
A cellular algebra is called cyclic cellular if all cell modules are cyclic. Most important examples of cellular algebras appearing in representation theory are in fact cyclic cellular. We prove that if $A$ is a cyclic cellular algebra,…
Cellular systems are observed everywhere in nature, from crystal domains in metals, soap froth and cucumber cells to the network of cosmological voids. Surprisingly, despite their disparate scale and origin all cellular systems follow…
Living systems, particularly multicellular systems, often seem hopelessly complex. But recent studies have suggested that beneath this complexity, there may be unifying quantitative principles that we are only now starting to unravel. All…
The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we…
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small…
The assembly index of assembly theory quantifies the minimal number of composition steps required to construct an object from elementary components. The study proves that the decision version of the assembly index problem is NP-complete,…
Let $ \mathbb{A}$ be a cellular algebra over a field $\mathbb{F}$ with a decomposition of the identity $ 1_{\mathbb{A}} $ into orthogonal idempotents $ e_i$, $i \in I$ (for some finite set $I$) satisfying some properties. We describe the…
Relation between problem hardness and solution space structure is an important research aspect. Model d-k-CSP generates very hard instances when $r=1$ and $r$ is near 1, where $r$ represents normalized constraint density. We find that when…
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…
A compact space $X$ is said to be minimal if there exists a map $f:X\to X$ such that the forward orbit of any point is dense in $X$. We consider rigid minimal spaces, motivated by recent results of Downarowicz, Snoha, and Tywoniuk [J. Dyn.…
Inside every living cell is the cytoplasm: a fluid mixture of thousands of different macromolecules, predominantly proteins. This mixture is where most of the biochemistry occurs that enables living cells to function, and it is perhaps the…
We are interested in the intersection of approximation algorithms and complexity theory, in particular focusing on the complexity class APX. Informally, APX $\subseteq$ NPO is the complexity class comprising optimization problems where the…
We discuss when a unital homomorphism {\phi} : C(X) \rightarrow A can be approximated by finite-dimensional homomorphisms, where X is a compact metric space and A is unital simple C*-algebra with tracial rank one. In this paper, we will…
A topological space $X$ is called almost discretely Lindel\"of if every discrete set $D \subset X$ is included in a Lindel\"of subspace of $X$. We say that the space $X$ is {\em $\mu$-sequential} if for every non-closed set $A \subset X$…
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…
We introduce the notion of a complex cell, a complexification of the cells/cylinders used in real tame geometry. For $\delta\in(0,1)$ and a complex cell $\mathcal{C}$ we define its holomorphic extension…