4355 search results - page 3 / 871 » Increasing Kolmogorov Complexity |
137
click to vote
ICALP
2003
Springer
15 years 9 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...
144
click to vote
SIROCCO
1997
15 years 5 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...
134
Voted
RSA
2000
15 years 3 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...
140
Voted
JCSS
2011
14 years 11 months ago
2011
109
Voted
STOC
2002
ACM
16 years 4 months ago
2002
ACM