Threshold of complexity in 2D binary cellular automata found through polynomial CNNs
Pazienza, Giovanni Egidio and Gomez-Ramirez, E. (2010) Threshold of complexity in 2D binary cellular automata found through polynomial CNNs. In: 12th international workshop on cellular nanoscale networks and their applications. CNNA 2010. Berkeley, 2010..
![[img]](https://eprints.sztaki.hu/style/images/fileicons/text.png) |
Text
CNNA.2010.5430277 - Published Version Restricted to Registered users only Download (74kB) |
Official URL: http://dx.doi.org/10.1109/CNNA.2010.5430277
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | Eszter Nagy |
| Date Deposited: | 12 Dec 2012 08:38 |
| Last Modified: | 12 Dec 2012 08:38 |
| URI: | https://eprints.sztaki.hu/id/eprint/6387 |
 |
Update Item |
