NP-complete problems
Enlarge text Shrink text-
Topic
|
System number
987007529953405171
-
Save successfulThe item can be found in your Personal ZoneשגיאהLog in to your account to save
Information for Authority record
Name (Hebrew)
בעיות NP שלמות
Name (Latin)
NP-complete problems
Name (Arabic)
مشاكل NP الكاملة
Other forms of name
Problems, NP-complete
See Also From tracing topical name
Computational complexity
MARC
MARC
Other Identifiers
Wikidata:
Q3244933
Library of congress:
sh 88005054
Sources of Information
- Work cat.: Scheffler, P. Linear-time algorithms for NP-complete problems ... 1987.
- LC data base, 8/10/88(NP-complete matching problem)
- Encyc. dict. math.:under Computational complexity (NP-complete [problems])
Wikipedia description:
This is a list of some of the more commonly known problems that are NP-complete when expressed as decision problems. As there are thousands of such problems known, this list is in no way comprehensive. Many problems of this type can be found in Garey & Johnson (1979).
Read more on Wikipedia >