Uniform characterizations of non-uniform complexity measures
نویسندگان
چکیده
منابع مشابه
Uniform Characterizations of Non-Uniform Complexity Measures
Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bo...
متن کاملRelating counting complexity to non-uniform probability measures
A standard method for designing randomized algorithms to approximately count the number of solutions of a problem in #P, is by constructing a rapidly mixing Markov chain converging to the uniform distribution over this set of solutions. This construction is not always an easy task, and it is conjectured that it is not always possible. We want to investigate other possibilities for using Markov ...
متن کاملExp-Uniform Distribution: Properties and Characterizations
In this paper, we study properties of exp-uniform distribution and its applications. We provide closed forms for the density function and moments of order statistics and we also discuss estimation of the parameters via the maximum likelihood method. We will present certain characterizations of exp-uniform distribution. The applications of this distribution are illustrated by fitting it to three...
متن کاملUniform measures and uniform rectifiability
In this paper it is shown that if μ is an n-dimensional Ahlfors-David regular measure in R which satisfies the so-called weak constant density condition, then μ is uniformly rectifiable. This had already been proved by David and Semmes in the cases n = 1, 2 and d − 1, and it was an open problem for other values of n. The proof of this result relies on the study of the n-uniform measures in R. I...
متن کاملAn Overview of Non-Uniform Parameterized Complexity
We consider several non-uniform variants of parameterized complexity classes that have been considered in the literature. We do so in a homogenous notation, allowing a clear comparison of the various variants. Additionally, we consider some novel (non-uniform) parameterized complexity classes that come up in the framework of parameterized knowledge compilation. We provide some (inclusion and se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1985
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(85)80026-7