Zobrazeno 1 - 10
of 146
pro vyhledávání: '"Miltzow, Tillmann"'
We survey the complexity class $\exists \mathbb{R}$, which captures the complexity of deciding the existential theory of the reals. The class $\exists \mathbb{R}$ has roots in two different traditions, one based on the Blum-Shub-Smale model of real c
Externí odkaz:
http://arxiv.org/abs/2407.18006
Given a set of objects O in the plane, the corresponding intersection graph is defined as follows. A vertex is created for each object and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit segment
Externí odkaz:
http://arxiv.org/abs/2401.02172
Autor:
Förster, Henry, Kindermann, Philipp, Miltzow, Tillmann, Parada, Irene, Terziadis, Soeren, Vogtenhuber, Birgit
We say that a (multi)graph $G = (V,E)$ has geometric thickness $t$ if there exists a straight-line drawing $\varphi : V \rightarrow \mathbb{R}^2$ and a $t$-coloring of its edges where no two edges sharing a point in their relative interior have the s
Externí odkaz:
http://arxiv.org/abs/2312.05010
We devise a data structure that can answer shortest path queries for two query points in a polygonal domain $P$ on $n$ vertices. For any $\varepsilon > 0$, the space complexity of the data structure is $O(n^{10+\varepsilon })$ and queries can be answ
Externí odkaz:
http://arxiv.org/abs/2303.00666
As set systems, hypergraphs are omnipresent and have various representations ranging from Euler and Venn diagrams to contact representations. In a geometric representation of a hypergraph $H=(V,E)$, each vertex $v\in V$ is associated with a point $p_
Externí odkaz:
http://arxiv.org/abs/2302.13597
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 26:2, Discrete Algorithms (August 20, 2024) dmtcs:10810
A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies $I'\in I$, a
Externí odkaz:
http://arxiv.org/abs/2301.03221
Autor:
Meijer, Lucas, Miltzow, Tillmann
In the art gallery problem, we are given a closed polygon $P$, with rational coordinates and an integer $k$. We are asked whether it is possible to find a set (of guards) $G$ of size $k$ such that any point $p\in P$ is seen by a point in $G$. We say
Externí odkaz:
http://arxiv.org/abs/2212.01211
Autor:
Miltzow, Tillmann, Stojaković, Miloš
In an Avoider-Enforcer game, we are given a hypergraph. Avoider and Enforcer alternate in claiming an unclaimed vertex, until all the vertices of the hypergraph are claimed. Enforcer wins if Avoider claims all vertices of an edge; Avoider wins otherw
Externí odkaz:
http://arxiv.org/abs/2208.06687
We consider the problem of finding weights and biases for a two-layer fully connected neural network to fit a given set of data points as well as possible, also known as EmpiricalRiskMinimization. Our main result is that the associated decision probl
Externí odkaz:
http://arxiv.org/abs/2204.01368
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for the complexi
Externí odkaz:
http://arxiv.org/abs/2112.04343