The space complexity of pebble games on trees (Q1147515): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An observation on time-storage trade off / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Storage requirements for deterministic polynomial time recognizable languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Time Versus Space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048639 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Space bounds for a game on graphs / rank | |||
Normal rank |
Latest revision as of 10:04, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The space complexity of pebble games on trees |
scientific article |
Statements
The space complexity of pebble games on trees (English)
0 references
1980
0 references
space complexity of pebble games on trees
0 references
lower bounds
0 references
register allocation
0 references
straight-line programs
0 references