Computational complexity of k-stable matchings.
Haris AzizGergely CsájiÁgnes CsehPublished in: CoRR (2023)
Keyphrases
- computational complexity
- np complete
- low complexity
- special case
- high computational complexity
- np hard
- computational efficiency
- memory requirements
- storage requirements
- search space
- artificial neural networks
- association rules
- computational cost
- multiscale
- computationally efficient
- motion vectors
- rate distortion
- decision problems
- web pages
- learning algorithm