Sometimes two irrational guards are needed

Cites work

\(\exists\mathbb{R}\)-complete decision problems about symmetric Nash equilibria in symmetric multi-player games
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.
A combinatorial theorem in plane geometry
A practical algorithm with performance guarantees for the art gallery problem
A short proof of Chvatal's Watchman Theorem
Algorithm 966: A practical iterative algorithm for the art gallery problem using integer linear programming
Algorithms in real algebraic geometry
An approximation algorithm for the art gallery problem
An Optimal Algorithm for Finding the Kernel of a Polygon
Beyond the Existential Theory of the Reals
Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
Complexity of geometric \(k\)-planarity for fixed \(k\)
Complexity of some geometric and topological problems
Computational complexity of art gallery problems
Computational complexity of multi-player evolutionarily stable strategies
Covering polygons is even Harder
Exotic quantifiers, complexity classes, and complete problems
Fixed points, Nash equilibria, and the existential theory of the reals
Guarding galleries and terrains
scientific article; zbMATH DE number 4065813 (Why is no real title available?)
scientific article; zbMATH DE number 4092241 (Why is no real title available?)
scientific article; zbMATH DE number 17663 (Why is no real title available?)
scientific article; zbMATH DE number 7724206 (Why is no real title available?)
Inapproximability results for guarding polygons and terrains
Integer realizations of disk and segment graphs
Intersection graphs of rays and grounded segments
Intersection graphs of segments
Irrational guards are sometimes needed
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
On classifying continuous constraint satisfaction problems
On restricted nonnegative matrix factorization
On the computational complexity of decision problems about multi-player Nash equilibria
Parameterized Hardness of Art Gallery Problems
Realization spaces of 4-polytopes are universal
Smoothing the gap between NP and ER
Sphere and dot product representations of graphs
The Art Gallery Problem is ∃ℝ-complete
The complexity of drawing a graph in a polygonal region
The complexity of positive semidefinite matrix factorization
The complexity of tensor rank
The complexity of the Hausdorff distance
Thirty Essays on Geometric Graph Theory
Topological art in simple galleries

This page was built for publication: Sometimes two irrational guards are needed

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7300018)