Signets
Signets
Tag cloud
Picture wall
Daily
RSS Feed
Login
Delete
Set public
Set private
Remember me
592
shaares
592
shaares
Filters
Links per page
20
50
100
“How do I construct reductions between problems to prove a problem is NP-complete?”
computer-science/complexity
Mon Mar 9 21:39:59 2020 * ·
permalink
·
https://cs.stackexchange.com/questions/1240/how-do-i-construct-reductions-between-problems-to-prove-a-problem-is-np-complete
Filters
Links per page
20
50
100
Fold
Fold all
Expand
Expand all
Are you sure you want to delete this link?
The personal, minimalist, super-fast, database free, bookmarking service by the Shaarli community