Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem
Nick Fischer · Society for Industrial and Applied Mathematics eBooks · 2024
How fast can you test whether a constellation of stars appears in the night sky? This question can be modeled as the computational problem of testing whether a set of points P can be moved into (or close to) another set Q under some prescribed group of transformations. Problems of this kind are subject to intensive study in computational geometry and enjoy countless theoretical and practical applications.