Symmetric space-bounded computation-Reference-Cited by-同舟云学术

Symmetric space-bounded computation

Published:1982-08 Issue:2 Volume:19 Page:161-187
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Lewis Harry R.,Papadimitriou Christos H.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. Random walks, universal sequences, and the complexity of maze problems;Aleliunas;Proc. 20th Annual Symposium on Foundations of Computer Science,1979

2. Translational lemmas, polynomial time, and (log n)i space;Book;Theoret. Comput. Sci.,1976

3. Characterizations of pushdown machines in terms of time-bounded computers;Cook;J. ACM,1971

4. An approach to the k-paths problem;Cypher;Proc. 12th Annual Symposium on Theory of Computing,1980

5. The directed subgraph homeomorphism problem;Fortune;Theoret. Comput. Sci.,1980

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

1. Space-efficient algorithms for reachability in directed geometric graphs;Theoretical Computer Science;2023-06

2. New approaches to quantify progressive damage and associated dynamic rock mass blockiness;Journal of Rock Mechanics and Geotechnical Engineering;2023-02

3. The Parallelism Tradeoff: Limitations of Log-Precision Transformers;Transactions of the Association for Computational Linguistics;2023

4. Time-symmetric Turing machines for computable involutions;Science of Computer Programming;2022-03

5. Equivalence classes and conditional hardness in massively parallel computations;Distributed Computing;2022-01-20