Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Letting Alice and Bob choose which problem to solve: implications to the study of cellular automata

From MaRDI portal
Publication:1935782
Jump to:navigation, search

DOI10.1016/j.tcs.2012.11.011zbMath1279.68244OpenAlexW2097950785MaRDI QIDQ1935782

Raimundo Briceño, Ivan Rapaport

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.011


zbMATH Keywords

cellular automatacommunication complexityintrinsic universality


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Communication theory (94A05)


Related Items (1)

Communication complexity meets cellular automata: necessary conditions for intrinsic universality






This page was built for publication: Letting Alice and Bob choose which problem to solve: implications to the study of cellular automata

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1935782&oldid=14370715"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 15:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki