منابع مشابه
Logarithmic Advice Classes
Karp and Lipton [11] introduced the notion of non-uniform complexity classes where a certain amount of additional information, the advice, is given for free. The advice only depends on the length of the input. Karp and Lipton initiated the study of classes with either logarithmic or polynomial advice; however later researchers [24, 19, 2, 14] concentrated on the study of classes of the form C/p...
متن کاملThe Structure of Logarithmic Advice Complexity Classes
A nonuniform class called here Full-P/log, due to Ko, is studied. It corresponds to polynomial time with logarithmically long advice. Its importance lies in the structural properties it enjoys, more interesting than those of the alternative class P/log; speciically, its introduction was motivated by the need of a logarithmic advice class closed under polynomial-time deterministic reductions. Se...
متن کاملCharacterizations of Logarithmic Advice Complexity Classes
The complexity classes P=log and Full-P=log, corresponding to the two standard forms of logarithmic advice for polynomial time, are studied. The novel proof technique of \doubly exponential skip" is introduced, and characterizations for these classes are found in terms of several other concepts, among them easy-to-describe boolean circuits and reduction classes of tally sets with high regularit...
متن کاملFrom Logarithmic Advice to Single-Bit Advice
Building on Barak’s work (Random’02), Fortnow and Santhanam (FOCS’04) proved a time hierarchy for probabilistic machines with one bit of advice. Their argument is based on an implicit translation technique, which allow to translate separation results for short (say logarithmic) advice (as shown by Barak) into separations for a single-bit advice. In this note, we make this technique explicit, by...
متن کاملModulo Classes and Advice
We prove an upper bound on computing advice for a language A in the class of languages acceptable in deterministic polynomial time with logarithmic advice, A 2 P=log), relative to A itself. We then provide conditions under which advice for a language A 2 P=log can be computed in PF(A), and conditions for the existence of a set A in P=log without advice in PF(A). We show that paddable languages ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90353-h