An exponential lower bound for real-time branching programs
From MaRDI portal
Publication:3763592
DOI10.1016/S0019-9958(86)80018-3zbMath0627.68044MaRDI QIDQ3763592
Publication date: 1986
Published in: Information and Control (Search for Journal in Brave)
Related Items (2)
Communication Complexity and Lower Bounds on Multilective Computations ⋮ A lower bound on branching programs reading some bits twice
This page was built for publication: An exponential lower bound for real-time branching programs
