Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Pebbling, Entropy and Branching Program Size Lower Bounds.

From MaRDI portal
Publication:2957923
Jump to:navigation, search

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


zbMATH Keywords

entropy methodbranching programspebblingsize lower bounds


Mathematics Subject Classification ID

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.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2957923&oldid=15956067"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki