scientific article
From MaRDI portal
Publication:3467513
DOI10.4086/toc.2015.v011a019zbMath1351.68084arXiv1208.2846OpenAlexW1500866162MaRDI 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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
data structureslower boundscircuit complexitycommunication complexityencodingadaptivedynamic data structures
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (5)
The function-inversion problem: barriers and opportunities ⋮ Sampling Lower Bounds: Boolean Average-Case and Permutations ⋮ Upper and Lower Bounds on the Power of Advice ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
This page was built for publication:
