O(n log n) algorithm and matching Omega(n log n) lower bound for partitioning a simple polygon's boundary into the minimum number of contiguous visible segments.
Two np-hard art-gallery problems for ortho-polygons.Mathematical Logic Quarterly, 41(2):261–267
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Introduces a rank measure for FO logic and proves a rank-preserving Gaifman normal form, yielding a simplified proof for almost-linear time decision of FO properties on nowhere-dense structures.
The coq-paradoxes library mechanizes Burali-Forti, Diaconescu, Reynolds, and Hurkens paradoxes to specify the placement of impredicativity, large elimination restrictions, and universe discipline in Rocq's CIC kernel.
citing papers explorer
-
A Rank-Preserving Gaifman Normal Form
Introduces a rank measure for FO logic and proves a rank-preserving Gaifman normal form, yielding a simplified proof for almost-linear time decision of FO properties on nowhere-dense structures.
-
Four Paradoxes and a Proof Assistant: Burali-Forti, Diaconescu, Reynolds, and Hurkens in the coq-paradoxes library
The coq-paradoxes library mechanizes Burali-Forti, Diaconescu, Reynolds, and Hurkens paradoxes to specify the placement of impredicativity, large elimination restrictions, and universe discipline in Rocq's CIC kernel.