3928 search results - page 114 / 786 » order 2006 |
132
click to vote
RSA
2006
15 years 4 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
142
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
109
click to vote
COMSIS
2004
15 years 4 months ago
2004
This paper describes architecture, design, and implementation of Multitutor, a Web-based environment for the development the elearning courses and for the use of them by the studen...
115
click to vote
COMBINATORICS
2000
15 years 4 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
141
click to vote
COMBINATORICS
2000
15 years 4 months ago
2000
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...