911 search results - page 19 / 183 » Kolmogorov Complexity Cores |
CSL
1987
Springer
15 years 5 months ago
1987
Springer
131
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
102
click to vote
APAL
2006
15 years 2 months ago
2006
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
101
click to vote
CIE
2009
Springer
15 years 8 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...
DAGSTUHL
2006
15 years 3 months ago
2006
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framewo...