NP-complete problem
McGraw-Hill Science & Technology Dictionary:
Top
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.
Post a question - any question - to the WikiAnswers community:
Copyrights:
McGraw-Hill Science & Technology Dictionary
McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved.
Read more