3 ms·

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?

• fooker 3y ago
  Are you perhaps confusing P with P complete? https://www.researchgate.net/profile/Walter-Ruzzo/publication/222089821_Limits_to_Parallel_Computation_P-Completeness_Theory/links/54fc88560cf20700c5e96c56/Limits-to-Parallel-Computation-P-Completeness-Theory.pdf https://www.researchgate.net/profile/Walter-Ruzzo/publicatio...
  • hgsgm 3y ago
    How does that matter? P-Complete is a subset of P.
  • gnull 3y ago
    What am I looking for in this 300 page document? Proof by intimidation, eh?