MCQOPTIONS
Bookmark
Saved Bookmarks
→
Subset Sum Problem Multiple Choice
→
General
→
Subset sum problem is an example of NP-complete pr...
1.
Subset sum problem is an example of NP-complete problem.
A.
true
B.
false
Answer» B. false
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Subset sum problem is an example of NP-complete problem.
What is the worst case time complexity of dynamic programming solution of the subset sum problem(sum=given subset sum)?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies
