Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Jesper Nederlof

Journal title: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing

Journal publisher: ACM

Published year: 2020

Published pages: 40-53

DOI identifier: 10.1145/3357713.3384264

ISBN: 9781450369794