The orthogonal boundary-point art gallery problem is ∃ℝ-complete, in Lean 4
Source: github.com/RBarish-UTokyo/OrthogonalArtGalleryProblem-Bound…
A Lean 4 formalization of material in a forthcoming manuscript entitled "The Orthogonal Art Gallery Problem is ∃ℝ-complete". A Lean 4 and Mathlib proof, for an explicit single-tape Turing machine model, that deciding whether an orthogonal simple polygon (every edge horizontal or vertical) with rational corners can be guarded by g points of its boundary, which together must see the whole closed polygon (the boundary-point variant), is ∃ℝ-complete under polynomial-time many-one reductions. The orthogonal point-point and point-boundary variants are the subject of the author's earlier entry…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-09-000004
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-09-000004/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-09-000004/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'