On the power of white pebbles

Authors:
Balasubramanian Kalyanasundaram;George Schnitger
Affiliations:
Department of Computer Science, The Pennsylvania State University;Department of Computer Science, The Pennsylvania State University
Venue:
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Year:
1988

Citing 4
Cited 1

White pebbles help

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A tight bound for black and white pebbles on the pyramid

Journal of the ACM (JACM)
Asymptotically tight bounds on time-space trade-offs in a pebble game

Journal of the ACM (JACM)
A comparison of the black and black-white pebble games (nondeterminism, straight-line program, complexity theory)

A comparison of the black and black-white pebble games (nondeterminism, straight-line program, complexity theory)

The PSPACE-Completeness of Black-White Pebbling

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We construct a family (Gp | p) of directed acyclic graphs such that any black pebble strategy for Gp requires p2 pebbles whereas 3p+1 pebbles are sufficient when white pebbles are allowed.