Author:
Briceño Raimundo,Rapaport Ivan
Subject
General Computer Science,Theoretical Computer Science
Reference28 articles.
1. N. Alon, W. Maass, Meanders, Ramsey’s theorem and lower bounds for branching programs, in: Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 1986, pp. 410–417.
2. Lower bounds to the complexity of symmetric boolean functions;Babai;Theoretical Computer Science,1990
3. L. Boyer, G. Theyssier, On local symmetries and universality in cellular automata, in: Proceedings of the 26th Annual Symposium on Theoretical Aspects of Computer Science, STACS, 2009, pp. 195–206.
4. R. Briceño, P.-E. Meunier, The structure of communication problems in cellular automata, in: DMTCS Proceedings, AUTOMATA 2011, 2011, pp. 59–76.
5. Cellular Automata Modeling of Physical Systems;Chopard,1998
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献