Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Race condition detection is NP-hard
1 view
Skip to first unread message
Sky89
May 22, 2018, 3:58:46 PM5/22/18
to
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.
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.
0 new messages