Pages that link to "Item:Q5230277"
From MaRDI portal
The following pages link to The art gallery problem is ∃ ℝ-complete (Q5230277):
Displayed 21 items.
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- Spaces of geodesic triangulations of surfaces (Q2172650) (← links)
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards (Q2173452) (← links)
- Finding minimum witness sets in orthogonal polygons (Q2206742) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Art gallery problem with rook and queen vision (Q2657110) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- Drawing Clustered Planar Graphs on Disk Arrangements (Q5216285) (← links)
- The Complexity of Positive Semidefinite Matrix Factorization (Q5355204) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918795) (← links)
- The visible-volume function of a set of cameras is continuous, piecewise rational, locally Lipschitz, and semi-algebraic in all dimensions (Q6073998) (← links)
- Reflective guarding a gallery (Q6091148) (← links)
- IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING? (Q6131225) (← links)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
- Topological art in simple galleries (Q6204773) (← links)