Flutterby™! : P=NP

Next unread comment / Catchup all unread comments User Account Info | Logout | XML/Pilot/etc versions | Long version (with comments) | Weblog archives | Site Map | | Browse Topics

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:
  1. 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?
  2. Will brute-force solutions to NP-complete problems present more general techniques for approaching some other NP-complete problems?
I'm going to get back to work now.

[ related topics: Work, productivity and environment Mathematics Archival ]

comments in ascending chronological order (reverse):

Comment policy

We will not edit your comments. However, we may delete your comments, or cause them to be hidden behind another link, if we feel they detract from the conversation. Commercial plugs are fine, if they are relevant to the conversation, and if you don't try to pretend to be a consumer. Annoying endorsements will be deleted if you're lucky, if you're not a whole bunch of people smarter and more articulate than you will ridicule you, and we will leave such ridicule in place.

Flutterby™ is a trademark claimed by

Dan Lyke
for the web publications at www.flutterby.com and www.flutterby.net.