Login
vertical_align_top
NP-completeness
(Topic)
Profile
More
EDIT
favorite
Main Details
Trivia
Quotes
Wikipedia
Media
Photos
Photo Gallery
News
Videos
Fashion
Album Covers
Publicity
Magazines
Pictorials
Interviews
Articles
Awards
Community
Fans
Websites
Lists
(5)
Comparisons
Predictions
Contributors
Vote Summary
Forum
Connections
Please login to post
content on this page.
wikifeed
posted a profile photo
over a year ago
NP-completeness
@NP-completeness
Like
Permalink
Flag
Press Enter to post.
over a year ago
Complexity classes
List, 3 members
Like
Press Enter to post.
Timeline
0
add_box
Please be the first person to add a timeline event for this topic!
Quotes
0
add_box
Please be the first person to
add a quote
for this topic!
Trivia
0
add_box
Please be the first person to
add trivia
for this topic!
over a year ago
Complexity classes
List, 1 member
Like
Press Enter to post.
over a year ago
NP-complete problems
List, 11 members
Like
Press Enter to post.
over a year ago
Mathematical optimization
List, 5 members
Like
Press Enter to post.
over a year ago
1971 in computing
List, 3 members
Like
Press Enter to post.
view all »
Profile Photo
·
Banner
·
Add Photos
·
About Text
·
Facts
·
Websites
In
computational complexity theory
, a problem is
NP-complete
when:
Connections
View More
Desktop |
Mobile
Terms of Use
·
Copyright
·
Privacy
© 2006-25, FamousFix · loaded in 0.25s