Complete distributional problems, hard languages, and resource-bounded measure
نویسندگان
چکیده
منابع مشابه
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 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
A general theory of resource-bounded measurability and measure is developed. Starting from any feasible probability measure ν on the Cantor space C (the set of all decision problems) and any suitable complexity class C ⊆ C, the theory identifies the subsets of C that are ν-measurable in C and assigns measures to these sets, thereby endowing C with internal measure-theoretic structure. Classes C...
متن کاملResource-bounded measure and autoreducibility
We prove that the following classes have resource-bounded measure zero: the class of self-reducible sets. the class of commitable sets. the class of sets that are non-adaptively autoreducible with a linear number of queries. the class of disjunctively autoreducible sets. 2
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00295-9