Basic Information
Communication Complexity Deals With Measuring The Amount Of Communication Needed For Computing Functions and Relations Whose Inputs Are Distributed Among Two Or More Processors. The Course Presents Upper and Lower Bounds in Several Models# Deterministic, Nondeterministic and Probabilistic. The Results Are Proven Using Combinatorial, Probabilistic and Algebraic Methods. Applications Of The Results to Complexity Theory and Vlsi Will Be Presented.
Faculty: Computer Science
|Graduate Studies
Pre-required courses
(94412 - Probability (advanced) and 236313 - Complexity Theory) or (104034 - Introduction to Probability H and 236313 - Complexity Theory)