Computational Complexity of k-Stable Matchings.
Haris AzizGergely CsájiÁgnes CsehPublished in: SAGT (2023)
Keyphrases
- computational complexity
- high computational complexity
- special case
- np complete
- computational cost
- storage requirements
- low complexity
- decision problems
- np hard
- computational efficiency
- computationally efficient
- real time
- linear computational complexity
- memory requirements
- rate distortion
- object recognition
- motion estimation
- information systems
- computer vision
- artificial intelligence
- data sets
- lower complexity
- database