223 search results - page 3 / 45 » A Note on Graph Pebbling |
STOC
2002
ACM
14 years 7 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...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
ICTAI
2009
IEEE
13 years 4 months ago
2009
IEEE
JUCS
2007
13 years 6 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...
FSTTCS
2009
Springer
14 years 1 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...