Sparse and Lopsided Set Disjointness via Information Theory
DOI10.1007/978-3-642-32512-0_44zbMath1372.68106OpenAlexW2176703953MaRDI QIDQ3167423
D. Sivakumar, Anirban Dasgupta, Ravi Kumar
Publication date: 2 November 2012
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32512-0_44
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) 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 (10)
This page was built for publication: Sparse and Lopsided Set Disjointness via Information Theory