A Modification of the Sarkar-Wang Algorithm and an Analysis of its Computational Complexity

Simple item page
dc.creatorHales, Jonathan
dc.creatorKarabash, Dmytro
dc.creatorLock, Michael T.
dc.date2007-11-28
dc.date2008-01-31
dc.date.accessioned2026-07-07T08:57:14Z
dc.date.available2026-07-07T08:57:14Z
dc.descriptionThe 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.
dc.description14 pages, 4 figures, fixed two typos
dc.identifierhttps://arxiv.org/abs/0711.4405
dc.identifierhttp://arxiv.org/abs/0711.4405
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146887
dc.subjectGeometric Topology
dc.titleA Modification of the Sarkar-Wang Algorithm and an Analysis of its Computational Complexity
dc.typetext

Files

Collections

arXiv