Time–Space Tradeoffs for Branching Programs-Reference-Cited by-同舟云学术

Time–Space Tradeoffs for Branching Programs

Published:2001-12 Issue:4 Volume:63 Page:542-572
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Beame Paul,Jayram T.S.,Saks Michael

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference31 articles.

1. K. R. Abrahamson, A time-space tradeoff for Boolean matrix multiplication, in Proceedings 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, October 1990, pp. 412–419, IEEE, New York.

2. Time-space tradeoffs for algebraic problems on general sequential models;Abrahamson;J. Comput. System Sci.,1991

3. M. Ajtai, Determinism versus non-determinism for linear time RAMs with memory restrictions, Technical Report, TR98-077, Electronic Colloquium in Computation Complexity, Revision 1, 1998. [Available at, http://www.eccc.uni-trier.de/eccc/.]

4. Determinism versus non-determinism for linear time RAMs with memory restrictions;Ajtai,1999

5. A non-linear time lower bound for boolean branching programs;Ajtai,1999

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lifting query complexity to time-space complexity for two-way finite automata;Journal of Computer and System Sciences;2024-05

2. Paradigms for Unconditional Pseudorandom Generators;Foundations and Trends® in Theoretical Computer Science;2024

3. Time and space complexity of deterministic and nondeterministic decision trees;Annals of Mathematics and Artificial Intelligence;2022-09-09

4. Satisfiability Algorithm for Syntactic Read-k-times Branching Programs;Theory of Computing Systems;2020-07-27

5. Weak lower bounds on resource-bounded compression imply strong separations of complexity classes;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23