Pages that link to "Item:Q1885923"
From MaRDI portal
The following pages link to Cellular automata and communication complexity (Q1885923):
Displayed 10 items.
- Traced communication complexity of cellular automata (Q549703) (← links)
- Communication complexity in number-conserving and monotone cellular automata (Q551188) (← links)
- Communication complexity and intrinsic universality in cellular automata (Q616488) (← links)
- An information-based classification of elementary cellular automata (Q1674805) (← links)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- Unraveling simplicity in elementary cellular automata (Q2628772) (← links)
- DESIGNING COMPLEX DYNAMICS IN CELLULAR AUTOMATA WITH MEMORY (Q2866066) (← links)
- (Q5010393) (← links)
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality (Q6095497) (← links)
- Classifying 1D elementary cellular automata with the 0-1 test for chaos (Q6111904) (← links)