A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Limits to parallel computation: P-completeness theory

1996
*
ChoiceReviews
*

This book is an introduction to the rapidly growing theory of Pcompleteness -the branch of complexity theory that focuses on identifying the "hardest" problems in the class P of problems solvable in polynomial time. P -complete problems are of interest because they all appear to lack highly parallel solutions. That is, algorithm designers have failed to find NC algorithms, feasible highly parallel solutions that take time polynomial in the logarithm of the problem size while using only a

doi:10.5860/choice.33-3959
fatcat:qjoueeu225gr7jvwdf6gkoxfbq