1511 search results - page 26 / 303 » Randomness, lowness and degrees |
JSYML
2006
14 years 11 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
JGT
2010
14 years 10 months ago
2010
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
CIE
2005
Springer
15 years 5 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
COMBINATORICA
2007
14 years 11 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
BSL
2005
14 years 11 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...