Printer Friendly
Dictionary, Encyclopedia and Thesaurus - The Free Dictionary
3,921,355,895 visitors served.
forum Join the Word of the Day Mailing List For webmasters
?
Dictionary/
thesaurus
Medical
dictionary
Legal
dictionary
Financial
dictionary
Acronyms
 
Idioms
Encyclopedia
Wikipedia
encyclopedia
?

NP-complete problem

   Also found in: Wikipedia 0.01 sec.
NP-complete problem [¦en¦pē kəm′plēt ‚präb·ləm]
(computer science)
One of the hardest problems in class NP, such that, if there are any problems in class NP but not in class P, this is one of them.


Want to thank TFD for its existence? Tell a friend about us, add a link to this page, add the site to iGoogle, or visit the webmaster's page for free fun content.
?Page tools
Printer friendly
Cite / link
Feedback
Mentioned in?  References in periodicals archive?   Encyclopedia browser?   Full browser?
No references found
 
It is one of the most famous NP-Complete problems, and even approximating the chromatic number within an acceptable ratio is NP-hard [7].
2] problems or NP-complete problems that are being used in aforementioned examples.
We assume here a familiarity with the rudiments of the theory of computational complexity and NP-complete problems as given by Garey & Johnson (1979).
 
 
 
Encyclopedia
?

Terms of Use | Privacy policy | Feedback | Advertise with Us | Copyright © 2012 Farlex, Inc.
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.