Proizvod vam ne odgovara? Nema veze! Možete nam vratiti unutar 30 dana
S poklon bonom ne možete pogriješiti. Za poklon bon primatelj može odabrati bilo što iz naše ponude.
30 dana za povrat kupljenih proizvoda
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.