1511 search results - page 1 / 303 » Randomness, lowness and degrees |
CIE
2009
Springer
14 years 4 months ago
2009
Springer
We show that every real low for Demuth randomness is of hyperimmune-free degree.
JSYML
2011
13 years 4 months ago
2011
We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost functi...
JSYML
2008
13 years 9 months ago
2008
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
MFCS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
FOCS
2004
IEEE
14 years 1 months ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...