Why Nostr? What is Njump?
2025-03-29 11:22:39
in reply to

bdf2121cc3334b35b6ecda66e471 on Nostr: Alexandre Oliva nprofile1q…6t7c5 no, not all NP-complete problems are like that. ...

no, not all NP-complete problems are like that.

You give me a map, and tell me to solve the traveling salesman problem, and I give you a result. How do you verify the result I give you _really is_ the shortest possible path, and not a lie?
Author Public Key
npub10cl2j4lcu0l649ndcsjv8mnwnygm24hke7wm0typze309vl0t9hqwkfhj9