arXiv · 0711.4405
A Modification of the Sarkar-Wang Algorithm and an Analysis of its Computational Complexity
Abstract
The Sarkar-Wang algorithm computes the hat version of the Heegaard Floer homology of a closed oriented three manifold. This paper analyzes the computational complexity of the Sarkar-Wang algorithm; then the algorithm is modified to obtain a better bound. Then the computational complexity of calculating HFK hat from a Heegaard diagram by means of the modified Sarkar-Wang algorithm is also analyzed. Under certain assumptions it is shown that the modified Sarkar-Wang algorithm is faster than the Manolescu-Ozsvath-Sarkar algorithm.
Explore related subjects
Keep this discovery
Jonathan Hales, Dmytro Karabash, Michael T. Lock. 2008-01-31. A Modification of the Sarkar-Wang Algorithm and an Analysis of its Computational Complexity. https://arxiv.org/abs/0711.4405
Cite the original work for its findings. Save a collection to share your selection of sources.