-
@ twofish
2025-05-07 16:36:29
Yeah I posted about a bit of nuance on this topic.
nostr:nevent1qqsx7gt7cmcmvz2p48dq9jvuq5fykwvfde3ham6dcsnq3fy3l76l4mgpz4mhxue69uhhyetvv9ujuerpd46hxtnfduhsygy7p5azck7lw9smdujgu3d0fq9r6kkeywvy6ux2ggtek5j7yl92hqpsgqqqqqqskw3ls2
In computation a good approach is to determine whether a problem can be reduced or transformed into a simpler or known form. I took some notes about different P vs NP Hard problems and mapping them out. For example, if you have a specific problem, but you can translate the problem to a graph coloring problem, then do that translation, solve it in that domain, and then translate it back. The graph coloring problem is defined here:
https://en.wikipedia.org/wiki/Graph_coloring
https://image.nostr.build/2ce96f6ce8fd14ab2cfcb4c6c61c2831609937e2ea17e27305c56c5d34b70e95.jpg