scientific article
From MaRDI portal
Publication:3827996
zbMath0674.03013MaRDI QIDQ3827996
Ion Chiţescu, Cristian S. Calude
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Axioms; other general questions in probability (60A05)
Related Items (5)
On words containing all short subwords ⋮ Randomness as an invariant for number representations ⋮ Non-contextual chocolate balls versus value indefinite quantum cryptography ⋮ Note on the topological structure of random strings ⋮ On the number of words containing the factor \((aba)^k\)
This page was built for publication: