A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets
نویسندگان
چکیده
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and quasilinear nondeterminism. We show that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and linear nondeterminism.
منابع مشابه
Algebraic Properties for Selector Functions
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regarding the deterministic advice complexity of the P-selective sets—i.e., the amount of Karp– Lipton advice needed for polynomial-time machines to recognize them in general—the best current upper bound is quadratic [Ko83] and the best current lower bound is linear [HT96]. We prove that every associat...
متن کاملLinear-Nondeterminism Linear Advice for the P-Selective Sets
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and quasilinear nondeterminism. We extend this by showing that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and linear nondeterminism.
متن کامل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...
متن کاملAdvice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties
This paper provides a tutorial overview of the advice complexity of the semifeasible sets—informally put, the class of sets having a polynomial-time algorithm that, given as input any two strings of which at least one belongs to the set, will choose one that does belong to the set. No previous familiarity with either the semifeasible sets or advice complexity will assumed, and when we include p...
متن کاملOptimal Advice
Ko Ko83] proved that the P-selective sets are in the advice class P/quadratic. We prove that the P-selective sets are in NP=linear T coNP=linear. We show this to be optimal in terms of the amount of advice needed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 4 شماره
صفحات -
تاریخ انتشار 1998