C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
The Complexity of Approximating the Matching Polynomial in the Complex Plane.
Ivona Bezáková
Andreas Galanis
Leslie Ann Goldberg
Daniel Stefankovic
Published in:
ACM Trans. Comput. Theory (2021)
Keyphrases
</>
data sets
real world
matching algorithm
polynomial hierarchy
three dimensional
computational complexity
complex systems
complex data
shape matching
optical flow
worst case
decision problems
matching process
epipolar lines
exponential size