Hardness of Approximation for Morse Matching

DOI10.1137/1.9781611975482.165zbMath1432.68473arXiv1801.08380OpenAlexW2785155418MaRDI QIDQ5236355

Abhishek Rathod, Ulrich Bauer

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.08380

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of digital topology (68U03)

Related Items (2)

Unnamed Item ⋮ Frontiers of sphere recognition in practice

This page was built for publication: Hardness of Approximation for Morse Matching