Pebbles and branching programs for tree evaluation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5605106 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 4045650 (Why is no real title available?)
- scientific article; zbMATH DE number 549856 (Why is no real title available?)
- scientific article; zbMATH DE number 3257409 (Why is no real title available?)
- A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
- A tight bound for black and white pebbles on the pyramid
- An observation on time-storage trade off
- Branching Programs and Binary Decision Diagrams
- Branching Programs for Tree Evaluation
- Communication complexity towards lower bounds on circuit depth
- Computational Complexity
- Fractional pebbling and thrifty branching programs
- Incremental branching programs
- On lower bounds for read-\(k\)-times branching programs
- On the Tape Complexity of Deterministic Context-Free Languages
- Storage requirements for deterministic polynomial time recognizable languages
- Super-logarithmic depth lower bounds via the direct sum in communication complexity
- The Pebbling Problem is Complete in Polynomial Space
- The space complexity of pebble games on trees
- Time-space trade-off lower bounds for randomized computation of decision problems
This page was built for publication: Pebbles and branching programs for tree evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979506)
