Hacker News new | ask | show | jobs
by gnull 1040 days ago
Cerium is correct, we don't know if P is efficiently parallelizable.

Is there a formal proof of what you're talking about that we can read?

1 comments

Are you perhaps confusing P with P complete?

https://www.researchgate.net/profile/Walter-Ruzzo/publicatio...

How does that matter? P-Complete is a subset of P.
What am I looking for in this 300 page document? Proof by intimidation, eh?