On computational complexity of Khovanov homology

Tuomas Kelomäki, Dirk Schütz

Computing the Jones polynomial of general link diagrams is known to be $\#$P-hard, while restricting the computation to braid closures on fixed number of strands allows for a polyn…