11 citations · 19 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2013
Pebbling Arguments for Tree Evaluation
David Liu
The Tree Evaluation Problem was introduced by Cook et al. in 2010 as a candidate for separating P from L and NL. The most general space lower bounds known for the Tree Evaluation P…
cs.CC2011★ 11 cited
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
Per Austrin, Toniann Pitassi, Yu Wu
We study the approximability of a number of graph problems: treewidth and pathwidth of graphs, one-shot black (and black-white) pebbling costs of directed acyclic graphs, and a var…