Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #10001 > unrolled thread
| Started by | Horizon68 <horizon@horizon.com> |
|---|---|
| First post | 2019-06-29 12:19 -0700 |
| Last post | 2019-06-29 12:19 -0700 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.programming
Race condition detection is NP-hard Horizon68 <horizon@horizon.com> - 2019-06-29 12:19 -0700
| From | Horizon68 <horizon@horizon.com> |
|---|---|
| Date | 2019-06-29 12:19 -0700 |
| Subject | Race condition detection is NP-hard |
| Message-ID | <qf8dji$tlj$3@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
csiph-web