相关论文: The Complexity of the Hausdorff Distance
We consider the problem of finding a Hamiltonian path with precedence constraints in the form of a partial order on the vertex set. This problem is known as Partially Ordered Hamiltonian Path Problem (POHPP). Here, we study the complexity…
We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…
We consider a finite fields version of the Erd\H{o}s-Falconer distance problem for two different sets. In a certain range for the sizes of the two sets we obtain results of the conjectured order of magnitude.
In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…
Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…
Two subanalytic subsets of R^n are called s-equivalent at a common point P if the Hausdorff distance between their intersections with the sphere centered at P of radius r vanishes of order greater than s when r tends to 0. In this paper we…
We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…
We prove that if $E\subseteq \R^2$ is analytic and $1<d < \dim_H(E)$, there are ``many'' points $x\in E$ such that the Hausdorff dimension of the pinned distance set $\Delta_x E$ is at least $d\left(1 -…
In this paper we deal with a best approximation of a vector with respect to a closed semi-algebraic set $C$ in the space $\mathbb{R}^n$ endowed with a semi-algebraic norm $\nu$. Under additional assumptions on $\nu$ we prove…
The Gromov-Hausdorff distance ($d_\mathrm{GH}$) provides a natural way of quantifying the dissimilarity between two given metric spaces. It is known that computing $d_\mathrm{GH}$ between two finite metric spaces is NP-hard, even in the…
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…
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show…
The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the…
Given two rational univariate polynomials, the Wasserstein distance of their associated measures is an algebraic number. We determine the algebraic degree of the squared Wasserstein distance, serving as a measure of algebraic complexity of…
The purpose of this paper is twofold. On a technical side, we propose an extension of the Hausdorff distance from metric spaces to spaces equipped with asymmetric distance measures. Specifically, we focus on the family of Bregman…
This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…
We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem is NP-complete for general neural networks and conjunctive…
Constraint satisfaction problems have been studied in numerous fields with practical and theoretical interests. In recent years, major breakthroughs have been made in a study of counting constraint satisfaction problems (or #CSPs). In…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
When solving the Hamiltonian path problem it seems natural to be given additional precedence constraints for the order in which the vertices are visited. For example one could decide whether a Hamiltonian path exists for a fixed starting…