21 search results - page 2 / 5 » Pebbling and optimal pebbling in graphs |
COCO
2010
Springer
13 years 9 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
JUCS
2007
13 years 5 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
DM
2000
13 years 5 months ago
2000
In this paper, we