Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference20 articles.
1. A non-linear time lower bound for Boolean branching programs;Ajtai,1999
2. Super-linear time-space tradeoff lower bounds for randomized computation;Beame,2000
3. Time-space trade-offs, multiparty communication complexity, and nearest neighbor problems;Beame,2002
4. Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication;Bollig;RAIRO Theoret. Inform. Appl.,2001
5. B. Bollig, Complexity theoretical results on nondeterministic graph-driven read-once branching programs, Forschungsbericht Universität Dortmund Nr. 772, 2002
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounded semantics;Theoretical Computer Science;2015-01