A tight bound for black and white pebbles on the pyramid

Authors:
Maria M. Klawe
Affiliations:
K51/281, IBM Research Laboratory, 5600 Cottle Road, San Jose, CA
Venue:
Journal of the ACM (JACM)
Year:
1985

Citing 0
Cited 7

White pebbles help

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On the power of white pebbles

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Narrow proofs may be spacious: separating space and width in resolution

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Towards an optimal separation of space and length in resolution

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Pebbles and Branching Programs for Tree Evaluation

ACM Transactions on Computation Theory (TOCT)
On the Relative Strength of Pebbling and Resolution

ACM Transactions on Computational Logic (TOCL)
Tight bounds for monotone switching networks via fourier analysis

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lengauer and Tarjan proved that the number of black and white pebbles needed to pebble the root of a tree is at least half the number of black pebbles needed to pebble the root. This result is extended to a larger class of acyclic directed graphs including pyramid graphs.