%0 Journal Article %1 journals/eccc/ECCC-TR97-039 %A Crescenzi, Pierluigi %A Trevisan, Luca %D 1997 %J Electronic Colloquium on Computational Complexity (ECCC) %K dblp %N 39 %T MAX NP-Completeness Made Easy %U http://dblp.uni-trier.de/db/journals/eccc/eccc4.html#ECCC-TR97-039 %V 4

@article{journals/eccc/ECCC-TR97-039, added-at = {2018-08-14T00:00:00.000+0200}, author = {Crescenzi, Pierluigi and Trevisan, Luca}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/267df808e99a3d7463ebfdbc833ec36b6/dblp}, ee = {http://eccc.hpi-web.de/eccc-reports/1997/TR97-039/index.html}, interhash = {ea859b68e0c403fc471b94247152f3d0}, intrahash = {67df808e99a3d7463ebfdbc833ec36b6}, journal = {Electronic Colloquium on Computational Complexity (ECCC)}, keywords = {dblp}, number = 39, timestamp = {2019-09-27T08:32:51.000+0200}, title = {MAX NP-Completeness Made Easy}, url = {http://dblp.uni-trier.de/db/journals/eccc/eccc4.html#ECCC-TR97-039}, volume = 4, year = 1997 }