P=NP
2022-05-26 17:03:11.460133+02 by ebwolf 0 comments
I'm dropping this here for a deeper
reading. A colleague was helping me with a Jenkins problem and said, at the end of the Slack conversation
"sure np :)" which got me off on a tangent into np-complete problems. I really, really like the article linked to.
But I currently understand only about 75% of it and want to read more. My own thoughts in the meantime:
- Can NP-complete problems be further broken into a topology of problems that can yield to brute-force techniques in my lifetime (perhaps with a boost from quantum computing) vs problems that won't ever yield t brute-force?
- Will brute-force solutions to NP-complete problems present more general techniques for approaching some other NP-complete problems?