Two dynamic programming algorithms for which interpreted pebbling helps
From MaRDI portal
Publication:2277375
DOI10.1016/0890-5401(91)90010-YzbMATH Open0725.90101MaRDI QIDQ2277375FDOQ2277375
Authors: H. Venkateswaran 
Publication date: 1991
Published in: Information and Computation (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3871062
- Pebbling Algorithms in Diameter Two Graphs
- Dynamic programming and pseudo-inverses
- From dynamic programming to bynamic programming
- scientific article; zbMATH DE number 1260458
- scientific article; zbMATH DE number 1431652
- Dynamic programming
- scientific article; zbMATH DE number 53073
- scientific article
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) 2-person games (91A05) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An observation on time-storage trade off
- Title not available (Why is that?)
- Fast Parallel Computation of Polynomials Using Few Processors
- Title not available (Why is that?)
- Speedups of deterministic machines by synchronous parallel machines
- Title not available (Why is that?)
- Properties that characterize LOGCFL
- Tree-size bounded alternation
- Title not available (Why is that?)
- Title not available (Why is that?)
- A New Pebble Game that Characterizes Parallel Complexity Classes
- The Pebbling Problem is Complete in Polynomial Space
- Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations
Cited In (3)
This page was built for publication: Two dynamic programming algorithms for which interpreted pebbling helps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277375)
