# On PP in communication complexity

Aho says $D(f)=O(N(f)N(\overline f))$ where $D(f)$ is deterministic communication complexity and $N(f)$ is non-deterministic version.

Do we know $PP(f)=\Omega(2^{(N(f)N(\overline f))^{O(1)}})$ or $PP(f)=O((N(f)N(\overline f))^{O(1)})$?

• Where does Aho say that? ​ ​ – user6973 Jan 8 '18 at 3:56
• @RickyDemer corrected – T.... Jan 8 '18 at 14:41