Abstract
The problem of determining whether a given (finite abstract) simplicial complex is homeomorphic to a sphere is undecidable. Still, the task naturally appears in a number of practical applications and can often be solved, even for huge instances, with the use of appropriate heuristics. We report on the current status of suitable techniques and their limitations. We also present implementations in polymake and relevant test examples. © 2014 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Joswig, M., Lutz, F. H., & Tsuruga, M. (2014). Heuristics for sphere recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8592 LNCS, pp. 152–159). Springer Verlag. https://doi.org/10.1007/978-3-662-44199-2_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
