%0 Journal Article %1 journals/toc/Kuperberg15 %A Kuperberg, Greg %D 2015 %J Theory of Computing %K dblp %P 183-219 %T How Hard Is It to Approximate the Jones Polynomial? %U http://dblp.uni-trier.de/db/journals/toc/toc11.html#Kuperberg15 %V 11

@article{journals/toc/Kuperberg15, added-at = {2019-05-14T00:00:00.000+0200}, author = {Kuperberg, Greg}, biburl = {https://www.bibsonomy.org/bibtex/220d99e9a9a8ac13461c040c23c911961/dblp}, ee = {https://doi.org/10.4086/toc.2015.v011a006}, interhash = {5e86d8ece8705b656a9ce6ab36285cf4}, intrahash = {20d99e9a9a8ac13461c040c23c911961}, journal = {Theory of Computing}, keywords = {dblp}, pages = {183-219}, timestamp = {2019-05-15T11:38:10.000+0200}, title = {How Hard Is It to Approximate the Jones Polynomial?}, url = {http://dblp.uni-trier.de/db/journals/toc/toc11.html#Kuperberg15}, volume = 11, year = 2015 }