Revision as of 18:45, 19 February 2008 edit 128.195.222.232 (talk) →Computational complexity ← Previous edit		Revision as of 06:27, 14 December 2008 edit undo Citation bot (talk \| contribs) Bots 5,867,705 edits m Updating page numbers after recent improvement to Template:Cite book. Removed redundant parameters. Next edit →
Line 32: == References == * {{cite book\|author = [[Michael R. Garey]] and [[David S. Johnson]] \| year = 1979 \| title = [[Computers and Intractability: A Guide to the Theory of NP-Completeness]] \| publisher = W.H. Freeman \| idisbn = ~~ISBN~~ 0-7167-1045-5}} A2.5: ND43, pg.218. [[Category:NP-complete problems]]

Quadratic assignment problem: Difference between revisions