TADM2E 8.5
From Algorithm Wiki
Revision as of 22:42, 14 October 2016 by
Rainhaven
(
talk
|
contribs
)
(Created page with "Answer to both a) and b) is no. Knapsack problem is NP-complete.")
(diff) ← Older revision |
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to:
navigation
,
search
Answer to both a) and b) is no. Knapsack problem is NP-complete.
Navigation menu
Personal tools
Create account
Log in
Namespaces
Page
Discussion
Variants
Views
Read
View source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help
Tools
What links here
Related changes
Special pages
Permanent link
Page information
