NP-hard

ID: np-hard

Top articles Latest articles New article in topic
NP-hard by Ciro Santilli 37 Updated 2025-07-16
A problem such that all NP problems can be reduced in polynomial time to it.
Read the full article

New to topics? Read the docs here!