Buscar
Mostrando ítems 1-2 de 2
Artículo
A geometric protocol for cryptography with cards
(Springer, 2015)
In the generalized Russian cards problem, the three players Alice, Bob and Cath draw a, b and c cards, respectively, from a deck of a + b + c cards. Players only know their own cards and what the deck of cards is. Alice ...
Artículo
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
(PeerJ, 2015)
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional ...