Author:
Damm Carsten,Holzer Markus
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of MAZE problems. In Proceedings of the 20th IEEE Annual Symposium on Foundations of Computer Science, pages 218–223, 1979.
2. J. L. Balcázar, J. Díaz, and J. Gabarró. Uniform characterizations of non-uniform complexity measures. Information and Control, 67:53–69, 1985.
3. C. Damm and M. Holzer. Inductive counting below LOGSPACE. In Proceedings of the 19th Conference on Mathematical Foundations of Computer Science, number 841 in LNCS, pages 276–285. Springer, August 1994.
4. G. Goodrich, R. Ladner, and M. Fischer. Straight line programs to compute finite languages. In Conference on Theoretical Computer Science, Waterloo, 1977.
5. R. L. Graham, B. L. Rothschild, and J. H. Spencer. Ramsey theory. Wiley, 1990.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Two-Way Non-Uniform Finite Automata;International Journal of Foundations of Computer Science;2022-12-12
2. Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata;Developments in Language Theory;2022
3. Two-Way Non-uniform Finite Automata;Developments in Language Theory;2021
4. Limited Two-Way Deterministic Finite Automata with Advice;Language and Automata Theory and Applications;2020
5. Determinism and Nondeterminism in Finite Automata with Advice;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018