4 papers
Devil's Games and : Continuous Games complete for the First-Order Theory of the Reals
Lucas Meijer, Arnaud de Mesmay, Tillmann Miltzow +2
We introduce the complexity class Quantified Reals (). Let FOTR be the set of true sentences in the first-order theory of the reals. A language is in $\text…
NP-membership for the boundary-boundary art-gallery problem
Jack Stade
The boundary-boundary art-gallery problem asks, given a polygon representing an art-gallery, for a minimal set of guards that can see the entire boundary of (the wall of th…
Two Tiling is Undecidable
Jack Stade
We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improve…
Better Neural Network Expressivity: Subdividing the Simplex
Egor Bakaev, Florestan Brunck, Christoph Hertrich +2
This work studies the expressivity of ReLU neural networks with a focus on their depth. A sequence of previous works showed that hidden layers are suffi…