2000 character limit reached
Fractional Pebbling Game Lower Bounds (1305.6376v1)
Published 28 May 2013 in cs.CC and cs.DS
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.