Two dynamic programming algorithms for which interpreted pebbling helps

Authors:
H. Venkateswaran
Affiliations:
School of Information and Computer Science, Georgia Institute of Technology, Atlanta, Georgia 30332-0280 USA
Venue:
Information and Computation
Year:
1991

Citing 9
Cited 0

Properties that characterize LOGCFL

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A new pebble game that characterizes parallel complexity classes

SIAM Journal on Computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A PSPACE Complete Problem Related to a Pebble Game

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth

WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
The monotone and planar circuit value problems are log space complete for P

ACM SIGACT News
Length of predicate calculus formulas as a new complexity measure

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Memory bounds for recognition of context-free and context-sensitive languages

FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
An observation on time-storage trade off

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider extensions of one-person and two-person pebble games that take into account the types of the gates of the circuits on which the games are played. A simple relationship is established between the extended games and the corresponding original games. This is useful in showing that the extended games allow more efficient pebbling than the original games on certain natural circuits for problems such as context-free language recognition and transitive closure of directed graphs.