Preskoči na sadržaj
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Jezik
Sva polja
Naslov
Autor
Tema
Signatura
ISBN/ISSN
Oznaka
Pronađi
Napredno
Algorithmic complexity of moti...
Citiraj ovo
Pošalji tekstualnu poruku
Pošalji ovo e-mailom
Ispiši
Izvezi zapis
Izvezi u RefWorks
Izvezi u EndNoteWeb
Izvezi u EndNote
Stalna poveznica
Algorithmic complexity of motifs clusters superfamilies of networks
Bibliografski detalji
Glavni autori:
Zenil, H
,
Kiani, N
,
Tegnér, J
Format:
Conference item
Izdano:
IEEE
2013
Primjerci
Opis
Slični predmeti
Prikaz za djelatnike knjižnice
Slični predmeti
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
od: Hector Zenil, i dr.
Izdano: (2018-07-01)
Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations
od: Hector Zenil, i dr.
Izdano: (2018-07-01)
The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy
od: Hector Zenil, i dr.
Izdano: (2019-06-01)
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
od: Abrahão, FS, i dr.
Izdano: (2024)
Approximations of algorithmic and structural complexity validate cognitive-behavioral experimental results
od: Hector Zenil, i dr.
Izdano: (2023-01-01)