Are there any known hard instances for NP-Complete Problems,or are there no general hard instances. So for different algorithms different instances are hard?
Are there any known hard instances for NP-Complete Problems
np