Nehodí sa? Žiadny problém! U nás môžete do 30 dní vrátiť
S darčekovým poukazom nešliapnete vedľa. Obdarovaný si za darčekový poukaz môže vybrať čokoľvek z našej ponuky.
30 dní na vrátenie tovaru
Communication Complexity (for Algorithm Designers) is the lecture notes from the author's eponymous course taught at Stanford in the winter quarter of 2015. Learn several canonical problems in communication complexity that are useful for proving lower bounds for algorithms and learn how to reduce lower bounds for fundamental algorithmic problems.