Communication Complexity: and Applications by Rao, Anup [Hardback] NEU
63,70 €
Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. The second part describes applications including circuit complexity, proof complexity, streaming algorithms, extension complexity of polytopes, and distributed computing.
Jetzt bei Ebay: