Kód: 10926021
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 use ... celý popis
Nákupem získáte 254 bodů
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.
Zařazení knihy Knihy v angličtině Computing & information technology Computer programming / software development Algorithms & data structures
2539 Kč
Osobní odběr Praha, Brno a 12903 dalších
Copyright ©2008-24 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies
Nákupní košík ( prázdný )