Publication:3467513
From MaRDI portal
DOI10.4086/toc.2015.v011a019zbMath1351.68084arXiv1208.2846MaRDI QIDQ3467513
Joshua Brody, Kasper Green Larsen
Publication date: 2 February 2016
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.2846
data structures; lower bounds; circuit complexity; communication complexity; encoding; adaptive; dynamic data structures
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68P05: Data structures
Related Items
Unnamed Item, Unnamed Item, Sampling Lower Bounds: Boolean Average-Case and Permutations, The function-inversion problem: barriers and opportunities, Upper and Lower Bounds on the Power of Advice
Cites Work