4355 search results - page 3 / 871 » Increasing Kolmogorov Complexity |
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
SIROCCO
1997
13 years 10 months ago
1997
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...
RSA
2000
13 years 8 months ago
2000
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the...
JCSS
2011
13 years 3 months ago
2011
STOC
2002
ACM
14 years 8 months ago
2002
ACM