Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe-Reference-Cited by-同舟云学术

Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe

Published:1991-09 Issue:2 Volume:86 Page:267-275
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Krause Matthias,Meinel Christoph,Waack Stephan

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. Two lower bounds for branching programs;Ajtai;Proc. 18th ACM Symp. on Theory of Computing,1986

2. On a method of obtaining lower bounds for the complexity of individual monotone functions;Andreev;Dokl. Akad. Nauk SSSR,1985

3. Bounded-width polynomial size branching programs recognize exactly those languages in NC1;Barrington;Proc. 18th ACM Symp. on Theory of Computing,1986

4. Alternation;Chandra;J. ACM,1981

5. Improved lower bounds for small depth circuits;Hastad;Proc. 18th ACM Symp. on Theory of Computing,1986

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

1. Streaming and Query Once Space Complexity of Longest Increasing Subsequence;Lecture Notes in Computer Science;2023-12-09

2. Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies;Natural Computing;2022-07-26

4. Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams;Computer Science – Theory and Applications;2017

5. Nondeterministic Unitary OBDDs;Computer Science – Theory and Applications;2017