Related papers: VEST is W[2]-hard

This paper considers coresets for the robust $k$-medians problem with $m$ outliers, and new constructions in various metric spaces are obtained. Specifically, for metric spaces with a bounded VC or doubling dimension $d$, the coreset size…

We introduce a novel multivariate approach for solving weighted parameterized problems. In our model, given an instance of size $n$ of a minimization (maximization) problem, and a parameter $W \geq 1$, we seek a solution of weight at most…

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…

A well-known theorem due to Ma\~n\'e-Sad-Sullivan and Lyubich asserts that J-stable maps are dense in any holomorphic family of rational maps in dimension 1. In this paper we show that the corresponding result fails in higher dimension.…

This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…

A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak near unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

This paper defines an invariant associated to Whitehead's certain exact sequence of a simply connected CW-complex which is much more elementary - and less powerful - than the boundary invariant of Baues. Nevertheless, in good cases, it…

The classical problem of algebraic models for homotopy types is precisely stated, to our knowledge for the first time. Two different natural statements for this problem are produced, the simplest one being entirely solved by the notion of…

The objective of this work is to reconsider the schematization problem of [6], with a particular focus on the global case over Z. For this, we prove the conjecture [Conj. 2.3.6][15] which gives a formula for the homotopy groups of the…

The currently best known algorithms for the numerical evaluation of hypergeometric constants such as $\zeta(3)$ to $d$ decimal digits have time complexity $O(M(d) \log^2 d)$ and space complexity of $O(d \log d)$ or $O(d)$. Following work…

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…

In contrast to other approaches to (2+1)-dimensional quantum gravity, the Wheeler-DeWitt equation appears to be too complicated to solve explicitly, even for simple spacetime topologies. Nevertheless, it is possible to obtain a good deal of…

In this paper, we investigate the nonemptiness of weak Pareto efficient solution set for a class of nonsmooth vector optimization problems on a nonempty closed constraint set without any boundedness and convexity assumptions. First, we…

We study the hardness of the dihedral hidden subgroup problem. It is known that lattice problems reduce to it, and that it reduces to random subset sum with density $> 1$ and also to quantum sampling subset sum solutions. We examine a…

Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving…

We prove a complexity dichotomy theorem for the six-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or #P-hard. The dichotomy criterion is…

We define a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that using this condition the iterative algorithm terminates successfully. Additionally we provide an O(n)…

The paper presents geometric models for the set WO of weak orders on a finite set. In particulary, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation…

We examine the topology of the clique complexes of the graphs of weakly and strongly separated subsets of the set $[n]=\{1,2,...,n\}$, which, after deleting all cone points, we denote by $\hat{\Delta}_{ws}(n)$ and $\hat{\Delta}_{ss}(n)$,…