Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems.

Niclas Boehmer Klaus Heeger Rolf Niedermeier

Published in: MFCS (2022)

Keyphrases

complexity analysis
data driven
matching process
problems involving
solving problems
neural network
real world
artificial intelligence
computational complexity
lower bound
np hard
image registration
pattern matching
incremental learning
shape matching