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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.