Event JSON
{
"id": "3d4ba6971be8ee33f85da2bdde6681e301947d47116d599a7a5061132b1e40cc",
"pubkey": "4126d00825e2d4a66c9a07e6a950fc4f3efb4cbf105c7d73509a34d1c6af7a18",
"created_at": 1743247850,
"kind": 1,
"tags": [
[
"p",
"47aa11be784ac0ed25f7f7523c5d5e6198c76dfe1dd59234d7034f04a1f9cbbb",
"wss://relay.mostr.pub"
],
[
"p",
"7e3ea957f8e3ffaa966dc424c3ee6e9911b556f6cf9db7ac811662f2b3ef596e",
"wss://relay.mostr.pub"
],
[
"e",
"7535507df081b21e0efd1933ae557ecbe2bd1c88791cad213535d9246d964cb6",
"wss://relay.mostr.pub",
"reply"
],
[
"proxy",
"https://snac.lx.oliva.nom.br/lxo/p/1743247850.368397",
"activitypub"
]
],
"content": "maybe go back to your reference book and see how the traveling salesman problem that is NP-complete is defined.\n\nwhile 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\n\nCC: nostr:nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpqg74pr0ncftqw6f0h7afrch27vxvvwm07rh2eydxhqd8sfg0eewasvxrl74\n",
"sig": "7371244f81a50f8e75850aae1b1c35603611117a758191137a41430c1e064d272033c888aafe7025664ba81999d61799aac6df280fdf5120659e7c605606231c"
}