Author:
Bisoyi Sagar,Dinesh Krishnamoorthy,Sarma Jayalal
Publisher
Springer International Publishing
Reference7 articles.
1. Buhrman, H., Cleve, R., Koucký, M., Loff, B., Speelman, F.: Computing with a full memory: catalytic space. STOC 2014, 857–866 (2014)
2. Buhrman, H., Koucký, M., Loff, B., Speelman, F.: Catalytic space: non-determinism and hierarchy. Theory Comput. Syst. 62(1), 116–135 (2018). https://doi.org/10.1007/s00224-017-9784-7
3. Duris, P., Galil, Z.: Fooling a two way automaton or one pushdown store is better than one counter for two way machines. Theor. Comput. Sci. 21, 39–53 (1982)
4. Jukna, S.: Limitations of incremental dynamic programming. Algorithmica 69(2), 461–492 (2014). https://doi.org/10.1007/s00453-013-9747-6
5. Koucký, M.: Catalytic computation. Bull. EATCS 118 (2016)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On pure space vs catalytic space;Theoretical Computer Science;2022-06