Author:
Clementi Andrea,Impagliazzo Russell
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference16 articles.
1. Arthur-Merlin games: a randomized proof system and a hierarchy of complexity classes;Babai;J. Comput. System Sci.,1985
2. Does co-NP have short interactive proofs?;Boppana;Inform. Process. Lett.,1987
3. On the predictability of coupled automata: An allegory about chaos;Buss,1990
4. On the complexity of cellular automata;Clementi,1994
5. Graph theory and interactive protocols for reachability problems on finite cellular automata;Clementi,1994
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reachability problem in non-uniform cellular automata;Information Sciences;2021-01
2. A Study of Chaos in Cellular Automata;International Journal of Bifurcation and Chaos;2018-03