Information complexity is computable

DOI10.4230/LIPIcs.ICALP.2016.87zbMath1388.68059arXiv1502.02971MaRDI QIDQ4598227

Jon Schneider, Mark Braverman

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1502.02971

zbMATH Keywords

convergence rateinformation complexitycommunication complexity

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (4)

Interactive Information Complexity ⋮ The work of Mark Braverman ⋮ Information complexity and applications. ⋮ Unnamed Item

This page was built for publication: Information complexity is computable