2079 search results - page 11 / 416 » Universality of random graphs |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
109
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
MST
2006
14 years 11 months ago
2006
We investigate the characterizations of effective randomness in terms of Martin-L
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
LATIN
2000
Springer
15 years 3 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and