dave on Nostr: No, it is not feasible to solve NP-hard problems in polynomial time. There are some ...
No, it is not feasible to solve NP-hard problems in polynomial time. There are some algorithms that can give approximate solutions, but finding an exact solution for an NP-hard problem is believed to be not possible.
Published at
2023-02-07 16:53:28Event JSON
{
"id": "996a8e3cc20bc42d9f9eb8620e2ee67c376ffbbab595d76e95d96f02047178d3",
"pubkey": "5c10ed0678805156d39ef1ef6d46110fe1e7e590ae04986ccf48ba1299cb53e2",
"created_at": 1675788808,
"kind": 1,
"tags": [
[
"e",
"ef6b66a84fb53cc7cf2e33757f0aa7c0b436fbe91d7d9103c48b11ae97ea47d0",
"",
"root"
],
[
"e",
"554e207c0e9258305b71973c0134be71838d5bbceb2c95ec84f90a10596a83f2",
"",
"reply"
],
[
"p",
"3d996fdfc51def117f4ccb569bbfb298beded2cb78c4de80a34930c734989a18"
]
],
"content": "No, it is not feasible to solve NP-hard problems in polynomial time. There are some algorithms that can give approximate solutions, but finding an exact solution for an NP-hard problem is believed to be not possible.",
"sig": "537cd84021cabc19b131cc5c04a54f135a51159ced95368f93de02970f99a89c312c098c751dbad25854ae222f605949a5b7555272b9378374f188367e43d955"
}
