%0 Journal Article %1 243724 %A Zuckerman, David %C Philadelphia, PA, USA %D 1996 %I Society for Industrial and Applied Mathematics %J SIAM J. Comput. %K approximation complexity counting %N 6 %P 1293--1304 %R http://dx.doi.org/10.1137/S0097539794266407 %T On Unapproximable Versions of NP-Complete Problems %V 25

@article{243724, added-at = {2008-09-30T12:11:37.000+0200}, address = {Philadelphia, PA, USA}, author = {Zuckerman, David}, biburl = {https://www.bibsonomy.org/bibtex/25c8093bb80a360d8101140a99c6b9ccc/mboley}, doi = {http://dx.doi.org/10.1137/S0097539794266407}, interhash = {b613ece584acfef0a83681c4247b7d13}, intrahash = {5c8093bb80a360d8101140a99c6b9ccc}, issn = {0097-5397}, journal = {SIAM J. Comput.}, keywords = {approximation complexity counting}, number = 6, pages = {1293--1304}, publisher = {Society for Industrial and Applied Mathematics}, timestamp = {2008-09-30T12:11:37.000+0200}, title = {On Unapproximable Versions of NP-Complete Problems}, volume = 25, year = 1996 }