相关论文: The Complexity of the Hausdorff Distance
We define the problem segment cover as follows. We are given a set of pairs of sub-intervals of the unit interval. The problem asks if there is a choice of a single interval from each pair such that the union of the chosen intervals covers…
We revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fr\'echet distance. Interestingly, no previous authors studied line simplification under these measures in its pure form, namely:…
In this work we have considered the complexity of the different structures as topological group on Z. We collect some new results, as well as some known results on the group of the integers in order to present: -A family of $2^\cont$…
We study the problem of deciding whether a point escapes a closed subset of $\mathbb{R}^d$ under the iteration of a continuous map $f \colon \mathbb{R}^d \to \mathbb{R}^d$ in the bit-model of real computation. We give a sound partial…
This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$,…
We establish formulas for bounds on the Haudorff measure of the intersection of certain Cantor sets with their translates. As a consequence we obtain a formula for the Hausdorff dimensions of these intersections.
This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…
The Jarn\'ik-Besicovitch theorem is a fundamental result in metric number theory which gives the Hausdorff dimension for limsup sets. We investigate a related problem of estimating the Hausdorff dimension of a liminf set. Let $h>0, \tau\geq…
We study the shortcut Fr\'{e}chet distance, a natural variant of the Fr\'{e}chet distance, that allows us to take shortcuts from and to any point along one of the curves. The classic Fr\'echet distance is a bottle-neck distance measure and…
$ \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\optX}[1]{#1^\star} \newcommand{\Qopt}{\Mh{\optX{Q}}} \newcommand{\rad}{r} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q}…
We show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$. This…
The Gromov-Hausdorff distance provides a metric on the set of isometry classes of compact metric spaces. Unfortunately, computing this metric directly is believed to be computationally intractable. Motivated by applications in shape…
In this paper we prove an upper bound on the "size" of the set of multiplicatively $\psi$-approximable points in $\mathbb R^d$ for $d>1$ in terms of $f$-dimensional Hausdorff measure. This upper bound exactly complements the known lower…
We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete
This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…
We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…
An explicit algorithm is given for the computation of the Hausdorff dimension of the closure of a regular branch group in terms of an arbitrary branch structure. We implement this algorithm in GAP and apply it to a family of GGS-groups…
We prove the elementary but surprising fact that the Hofer distance between two closed subsets of a symplectic manifold can be expressed in terms of the restrictions of Hamiltonians to one of the subsets; this helps explain certain…
In this paper we study the singular set in the parabolic obstacle problem for general obstacles $\varphi \in C^{2,1}$. We prove that the singular set has parabolic Hausdorff dimension at most $n-1$. Prior to our result, this was only known…
In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset,…