Re:Parallelization of SAT Algorithms on GPUs [pdf]
by tlb on Saturday February 18, 2017 @02:14AM
(#13673932)
It is an open question whether there exist algorithms that cannot be parallelized. Some that are most likely to be inherently sequential are listed here: https://en.wikipedia.org/wiki/P-complete#P-complete_problems
Wow, that's interesting! Are there any other examples where a sequential algorithm beats a parallel one?