ROUNDS VERSUS TIME FOR THE 2-PERSON PEBBLE GAME

被引：1
|
作者：
KALYANASUNDARAM, B [1 ]
SCHNITGER, G [1 ]
机构：
[1] PENN STATE UNIV, DEPT COMP SCI, UNIVERSITY PK, PA 16802 USA
来源：
INFORMATION AND COMPUTATION | 1990年 / 88卷 / 01期
关键词：
Computer Programming - Algorithms - Logic Circuits - Theory;
D O I：
10.1016/0890-5401(90)90002-Y
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show the following results for rounds/time trade-offs in the two person pebble game: 1. 1. For every R and n (R = O( n logn)), there is a bounded degree graph of n vertices for which the Pebbler can win in R rounds only in time Ω( n logR). 2. 2. There is a graph that exhibits almost tight round/time trade-offs for all rounds. 3. 3. There is no graph with tight round/time trade-offs for all rounds. As a consequence, we improve the simulation of bounded fan-in circuits by unbounded fan-in circuits, extending the size/depth trade-off of Paterson and Valiant. © 1990.
引用
收藏
页码：1 / 17
页数：17
相关论文
共 50 条
12345