The Computational Complexity of some Guard Sets in Polygons.
Uwe AhlfeldHans-Dietrich HeckerPublished in: J. Inf. Process. Cybern. (1992)
Keyphrases
- computational complexity
- low complexity
- special case
- np complete
- computational load
- bit rate
- set theoretic
- machine learning
- memory requirements
- decision problems
- three dimensional
- information retrieval
- np hard
- evolutionary algorithm
- computationally efficient
- spatial data
- bayesian networks
- image sequences
- information systems
- high computational complexity