Pebbling, Entropy and Branching Program Size Lower Bounds.
From MaRDI portal
Publication:2957923
DOI10.4230/LIPIcs.STACS.2013.622zbMath1354.68065OpenAlexW2240673641MaRDI QIDQ2957923
Balagopal Komarath, M. N. Jayalal Sarma
Publication date: 30 January 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2013.622
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This page was built for publication: Pebbling, Entropy and Branching Program Size Lower Bounds.