Why Nostr? What is Njump?
2025-03-29 11:30:50
in reply to

Alexandre Oliva on Nostr: maybe go back to your reference book and see how the traveling salesman problem that ...

maybe go back to your reference book and see how the traveling salesman problem that is NP-complete is defined.

while at that, look at the definition of NP-complete: problems that (apparently) cannot be solved in polynomial time, but whose solutions can be verified in polynomial time

CC:
Author Public Key
npub1gyndqzp9ut22vmy6qln2j58uful0kn9lzpw86u6sng6dr3400gvq5sczug