154 search results - page 12 / 31 » rsa 2006 |
RSA
2000
13 years 9 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...
RSA
1998
13 years 9 months ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
RSA
1998
13 years 9 months ago
1998
Let Un,p be the random unary predicate and Tk the almost sure first-order theory of Un,p under the linear ordering, where k is a positive integer and n−1/k p(n) n−1/(k+1) . F...
RSA
2002
13 years 9 months ago
2002
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...
RSA
2002
13 years 9 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...