White pebbles help
From MaRDI portal
Publication:1111025
DOI10.1016/0022-0000(88)90023-2zbMath0657.68049OpenAlexW4210341755MaRDI QIDQ1111025
Publication date: 1988
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(88)90023-2
computational complexitystraight-line programspebble gameblack-white pebblingnondeterministic computations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A variation on the min cut linear arrangement problem ⋮ On the power of white pebbles ⋮ Pebbling dynamic graphs in minimal space
Cites Work
- The space complexity of pebble games on trees
- A comparison of two variations of a pebble game on graphs
- An observation on time-storage trade off
- Storage requirements for deterministic polynomial time recognizable languages
- Relationships between nondeterministic and deterministic tape complexities
- A tight bound for black and white pebbles on the pyramid
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: White pebbles help
