The Matching Polytope has Exponential Extension Complexity.

Thomas Rothvoss

Published in: J. ACM (2017)

Keyphrases

linear complexity
matching algorithm
worst case
shape matching
matching process
computational complexity
computational cost
memory requirements
graph matching
average case complexity
neural network
double exponential
feature matching
affine invariant
directed graph
image matching
multiscale
case study