137
click to vote
SIROCCO
1997
15 years 4 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...