Sciweavers

RSA
2000
104views more  RSA 2000»
13 years 4 months ago
Construction of expanders and superconcentrators using Kolmogorov complexity
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...
Uwe Schöning