Branching Programs for Tree Evaluation

DOI10.1007/978-3-642-03816-7_16zbMath1250.68106OpenAlexW1556429797MaRDI QIDQ3182923

Mark Braverman, Dustin Wehr, Pierre McKenzie, Rahul Santhanam, Stephen A. Cook

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17973729/Braverman_Cook_ET_AL_2009_Branching_Programs_for_Tree_Evaluation.pdf

Mathematics Subject Classification ID

Related Items (1)

Length of polynomials over finite groups

Cites Work

• Incremental branching programs
• An observation on time-storage trade off
• Storage requirements for deterministic polynomial time recognizable languages
• Super-logarithmic depth lower bounds via the direct sum in communication complexity
• On lower bounds for read-\(k\)-times branching programs
• A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
• On the Tape Complexity of Deterministic Context-Free Languages
• Branching Programs and Binary Decision Diagrams
• Computational Complexity
• Unnamed Item
• Unnamed Item

This page was built for publication: Branching Programs for Tree Evaluation