Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #5062
| Path | csiph.com!eternal-september.org!feeder.eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail |
|---|---|
| From | Horizon68 <horizon@horizon.com> |
| Newsgroups | comp.programming.threads |
| Subject | Race condition detection is NP-hard |
| Date | Sat, 29 Jun 2019 12:19:33 -0700 |
| Organization | A noiseless patient Spider |
| Lines | 19 |
| Message-ID | <qf8dk5$tlj$4@dont-email.me> (permalink) |
| Mime-Version | 1.0 |
| Content-Type | text/plain; charset=utf-8; format=flowed |
| Content-Transfer-Encoding | 7bit |
| Injection-Date | Sat, 29 Jun 2019 19:19:33 -0000 (UTC) |
| Injection-Info | reader02.eternal-september.org; posting-host="4e8ed5a7e20fa4747664d5cce80b40d9"; logging-data="30387"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/7pSYCcupO4KVLoI1jhwIrWHXDViSBx7E=" |
| User-Agent | Mozilla/5.0 (Windows NT 10.0; WOW64; rv:60.0) Gecko/20100101 Thunderbird/60.7.2 |
| Cancel-Lock | sha1:z/3i5lfNXih5eN1t+PGJc8eS22g= |
| Content-Language | en-US |
| X-Mozilla-News-Host | news://news.eternal-september.org:119 |
| Xref | csiph.com comp.programming.threads:5062 |
Show key headers only | View raw
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 comp.programming.threads | Previous | Next | Find similar | Unroll thread
Race condition detection is NP-hard Horizon68 <horizon@horizon.com> - 2019-06-29 12:19 -0700
csiph-web