✦ LIBER ✦
A P-Completeness Result for Visibility Graphs of Simple Polygons
✍ Scribed by Jana Dietel; Hans-Dietrich Hecker
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 187 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.