A Modification of the Sarkar-Wang Algorithm and an Analysis of its Computational Complexity
Geometric Topology
2008-01-31 v2
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.
Cite
@article{arxiv.0711.4405,
title = {A Modification of the Sarkar-Wang Algorithm and an Analysis of its Computational Complexity},
author = {Jonathan Hales and Dmytro Karabash and Michael T. Lock},
journal= {arXiv preprint arXiv:0711.4405},
year = {2008}
}
Comments
14 pages, 4 figures, fixed two typos