Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #4332 > unrolled thread
| Started by | Sky89 <Sky89@sky68.com> |
|---|---|
| First post | 2018-05-22 15:58 -0400 |
| Last post | 2018-05-22 15:58 -0400 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.programming.threads
Race condition detection is NP-hard Sky89 <Sky89@sky68.com> - 2018-05-22 15:58 -0400
| From | Sky89 <Sky89@sky68.com> |
|---|---|
| Date | 2018-05-22 15:58 -0400 |
| Subject | Race condition detection is NP-hard |
| Message-ID | <pe1spj$a7s$2@dont-email.me> |
Hello,' NP-hard problem means there is no known algorithm can solve it in a polynomial time, so that the time to find a solution grows exponentially with problem size. Although it has not been definitively proven that, there is no polynomial algorithm for solving NP-hard problems, many eminent mathematicians have tried and failed. Race condition detection is NP-hard Read more here: https://pages.mtu.edu/~shene/NSF-3/e-Book/RACE/difficult.html Thank you, Amine Moulay Ramdane.
Back to top | Article view | comp.programming.threads
csiph-web