Computing and Information Technology Interactive Digital Educational Library


Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item:

Title: NP-complete
Issue Date: 6-Sep-2002
Publisher: PlanetMath
Abstract: A problem ... is ... {} if for any ... there is a Cook reduction of ... to pi. Hence if ... then every ... problem would be in ... . A slightly stronger definition requires a Karp reduction or Karp reduction of corresponding decision problems as appropriate. A search problem
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat

All items in DSpace are protected by copyright, with all rights reserved.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback