Fractional Pebbling Game Lower Bounds
Frank Vanderzwet

TL;DR
This paper establishes a tight lower bound on the pebble weight needed for fractional pebbling of balanced d-ary trees, linking it to computational complexity and space lower bounds.
Contribution
It solves an open problem by providing a precise lower bound for fractional pebbling on balanced d-ary trees, advancing understanding in computational complexity.
Findings
Proves a tight lower bound on fractional pebbling weight.
Links fractional pebbling bounds to branching program complexity.
Contributes to separating complexity classes P and NL.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Polynomial and algebraic computation · Data Management and Algorithms
