Resource bounded randomness and weakly complete problems
نویسندگان
چکیده
منابع مشابه
Resource Bounded Randomness and Weakly Complete Problems 1
We introduce and study resource bounded random sets based on Lutz's concept of resource bounded measure ((7, 8]). We concentrate on n c-randomness (c 2) which corresponds to the polynomial time bounded (p-) measure of Lutz, and which is adequate for studying the internal and quantitative structure of E = DTIME(2 lin). However we will also comment on E2 = DTIME(2 pol) and its corresponding (p2-)...
متن کاملResource-Bounded Measure and Randomness
Supported by the Human Capital and Mobility Program of the European Community under grant CHRX-CT93-0415 (COLORET). Mathematisches Institut, Universit at Heidelberg, D-69120 Heidelberg, Germany Universidad de Zaragoza, Dept. Inform atica, CPS, Mar a del Luna 3, E-50015 Zaragoza, Spain We survey recent results on resource-bounded measure and randomness in structural complexity theory. In partic...
متن کاملResource bounded randomness and computational complexity
The following is a survey of resource bounded randomness concepts and their relations to each other. Further, we introduce several new resource bounded randomness concepts corresponding to the classical randomness concepts, and show that the notion of polynomial time bounded Ko randomness is independent of the notions of polynomial time bounded Lutz, Schnorr and Kurtz randomness. Lutz has conje...
متن کاملComplete distributional problems, hard languages, and resource-bounded measure
We say that a distribution μ is reasonable if there exists a constant s ≥ 0 such that μ({x | |x| ≥ n}) = Ω( 1 n s ). We prove the following result, which suggests that all DistNP-complete problems have reasonable distributions. If NP contains a DTIME(2n)-bi-immune set, then every DistNP-complete set has a reasonable distribution. It follows from work of Mayordomo [May94] that the consequent hol...
متن کاملResource-Bounded Balanced Genericity, Stochasticity and Weak Randomness
We introduce balanced t(n)-genericity which is a reenement of the genericity concept of Ambos-Spies, Fleischhack and Huwig 2] and which in addition controls the frequency with which a condition is met. We show that this concept coincides with the resource-bounded version of Church's stochasticity 6]. By uniformly describing these concepts and weaker notions of stochasticity introduced by Wilber...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(95)00260-x