相关论文: The Complexity of the Hausdorff Distance
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…
We develop quantitative algorithmic information bounds for orthogonal projections and distances in the plane. Under mild independence conditions, the distance $|x-y|$ and a projection coordinate $p_e x$ each retain at least half the…
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
Expansions in non-integer bases have been investigated abundantly since their introduction by R\'enyi. It was discovered by Erd\H{o}s et al. that the sets of numbers with a unique expansion have a much more complex structure than in the…
Computing the infinity Wasserstein distance and retrieving projections of a probability measure onto a closed subset of probability measures are critical sub-problems in various applied fields. However, the practical applicability of these…
The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
In this short note, the author shows that the gap problem of some 3-XOR is NP-hard and can be solved by running Charikar\&Wirth's SDP algorithm for two rounds. To conclude, the author proves that $P=NP$.
We prove a quantitative distortion theorem for iterated function systems that generate sets of continued fractions. As a consequence, we obtain upper and lower bounds on the Hausdorff dimension of any set of real or complex continued…
In many kinds of infinite-state systems, the coverability problem has significantly lower complexity than the reachability problem. In order to delineate the border of computational hardness between coverability and reachability, we propose…
In this paper, we study Hausdorff and Fourier dimension from the point of view of effective descriptive set theory and Type-2 Theory of Effectivity. Working in the hyperspace $\mathbf{K}(X)$ of compact subsets of $X$, with $X=[0,1]^d$ or…
Let $A\sub \R^{n+r}$ be a set definable in an o-minimal expansion $\S$ of the real field, $A' \sub \R^r$ be its projection, and assume that the non-empty fibers $A_a \sub \R^n$ are compact for all $a \in A'$ and uniformly bounded, {\em…
The study of the closest point(s) on a statistical model from a given distribution in the probability simplex with respect to a fixed Wasserstein metric gives rise to a polyhedral norm distance optimization problem. There are two components…
In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of…
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…
In this paper geometry of Gromov-Hausdorff distance on the class of all metric spaces considered up to an isometry is investigated. For this class continuous curves and their lengths are defined, and it is shown that the Gromov-Hausdorff…
We study the problem of computing the upper bound of the discrete Fr\'{e}chet distance for imprecise input, and prove that the problem is NP-hard. This solves an open problem posed in 2010 by Ahn \emph{et al}. If shortcuts are allowed, we…
The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic automata. In this paper, we present a characterization of…
Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…
The Hausdorff dimension of the set of simultaneously tau well approximable points lying on a curve defined by a polynomial P(X)+alpha, where P(X) is a polynomial with integer coefficients and alpha is in R, is studied when tau is larger…