Revision as of 02:08, 4 December 2005 edit Daverobe (talk \| contribs) 79 edits added detail and a reference ← Previous edit		Revision as of 02:09, 4 December 2005 edit undo Daverobe (talk \| contribs) 79 edits No edit summary Next edit →
Line 13: Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on<p> 20-22 Oct. 1997 Page(s):406 - 415 <p> J. Hastad. "Some optimal inapproximability results." In proceedings of the 29th ACM STOC, 1-10, 1997

Karloff–Zwick algorithm: Difference between revisions