Fractional Pebbling Game Lower Bounds
Computational Complexity
2013-05-29 v1 Data Structures and Algorithms
Abstract
Fractional pebbling is a generalization of black-white pebbling introduced recently. In this reasearch paper we solve an open problem by proving a tight lower bound on the pebble weight required to fractionally pebble a balanced d-ary tree of height h. This bound has close ties with branching programs and the separation of P from NL.
Cite
@article{arxiv.1305.6376,
title = {Fractional Pebbling Game Lower Bounds},
author = {Frank Vanderzwet},
journal= {arXiv preprint arXiv:1305.6376},
year = {2013}
}
Comments
Graduate Research Paper for University of Toronto. Completion of paper assisted by Professor Stephen Cook and Professor Toniann Pitassi