On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata-Reference-Cited by-同舟云学术

On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata

Published:2001-09 Issue:2 Volume:169 Page:284-296
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Hromkovič Juraj,Schnitger Georg

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference22 articles.

1. Complexity classes in communication complexity theory;Babai;in,1986

2. Mehlhorn, K., and Schmidt, E.1982, Las Vegas is better than determinism in VLSI and distributed computing, inProceedings, 14th ACM Symposium on Theory of Computing, San Francisco, CA, pp. 330–337.

3. Relationships between nondeterministic and deterministic tape complexities;Savitch;J. Comput. System Sci.,1970

4. Exact lower bounds for computing Boolean functions on CREW PRAMs;Dietzfelbinger;J. Comput. System Sci.,1994

5. Bovet, D. P, and, Crescenzi, P. 1994, Introduction to the Theory of Complexity, Prentice Hall, New York.

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

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

2. Exact Affine Counter Automata;International Journal of Foundations of Computer Science;2022-04

3. Self-Verifying Pushdown and Queue Automata;Fundamenta Informaticae;2021-05-12

4. Error-Free Affine, Unitary, and Probabilistic OBDDs;International Journal of Foundations of Computer Science;2021-05-12

5. Iterative arrays with self-verifying communication cell;Natural Computing;2020-11-05