Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Chapter 15: NP, NP completeness, and the Cook-Levin Theorem #778

Closed
MKJM2 opened this issue Dec 5, 2022 · 0 comments
Closed

Chapter 15: NP, NP completeness, and the Cook-Levin Theorem #778

MKJM2 opened this issue Dec 5, 2022 · 0 comments

Comments

@MKJM2
Copy link

MKJM2 commented Dec 5, 2022

Under the definition of NP-hard there is a dead link for a website with examples of NP-complete problems. The updated link should be: https://www.csc.kth.se/tcs/compendium/
@boazbk boazbk closed this as completed in 47a24e4 Jul 24, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@MKJM2