𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational Complexity Volume 7183 || Algorithmic Complexity and Cellular Automata

✍ Scribed by Meyers, Robert A.

Book ID
111875949
Publisher
Springer New York
Year
2012
Weight
876 KB
Category
Article
ISBN
1461418003

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Computational Complexity of Finit
On the Computational Complexity of Finite Cellular Automata
✍ K. Sutner πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

[Lecture Notes in Computer Science] Lang
[Lecture Notes in Computer Science] Language and Automata Theory and Applications Volume 7183 || A Parameterized Complexity Tutorial
✍ Dediu, Adrian-Horia; MartΓ­n-Vide, Carlos πŸ“‚ Article πŸ“… 2012 πŸ› Springer Berlin Heidelberg 🌐 German βš– 291 KB

This Book Constitutes The Refereed Proceedings Of The 6th International Conference On Language And Automata Theory And Applications, Lata 2012, Held In A CoruΓ±a, Spain In March 2012. The 41 Revised Full Papers Presented Together With 3 Invited Talks And 2 Invited Tutorials Were Carefully Reviewed An