On counting problems and the polynomial-time hierarchy
نویسندگان
چکیده
منابع مشابه
The Analytic Polynomial Time Hierarchy
Motivated by results on interactive proof systems we investigate an 9-8-hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomial-time hierarchy, is called the analytic polynomial-time hierarchy. It is shown that every class of this hierarchy coincides with one of the following classes: pk, pk (k 0), PSPACE, exp k ...
متن کاملFully polynomial time approximation schemes (FPTAS) for some counting problems
In this thesis we develop FPTASs for the counting problems of m−tuples, contingency tables with two rows, and 0/1 knapsack. For the problem of counting m−tuples, we design two algorithms, one is strongly polynomial. As far as we know, these are the first FPTASs for this problem. For the problem of counting contingency tables we improve significantly over the running time of existing algorithms....
متن کاملTime-Space Tradeoffs in the Counting Hierarchy
We extend the lower bound techniques of [17], to the unbounded-error probabilistic model. A key step in the argument is a generalization of Nepomnjaščiı̆’s theorem from the Boolean setting to the arithmetic setting. This generalization is made possible, due to the recent discovery of logspaceuniform TC0 circuits for iterated multiplication [11]. Here is an example of the sort of lower bounds tha...
متن کاملOn Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy
We consider the problem of proving circuit lower bounds against the polynomialtime hierarchy. We first revisit a lower bound given by Kannan [Kan82], and for any fixed integer k > 0, we give an explicit Σp2 language, recognizable by a Σ p 2-machine with running time O(nk 2+k), that requires circuit size > nk. Next, as our main results, we give relativized results showing the difficulty of provi...
متن کاملthe effects of time planning and task complexity on accuracy of narrative task performance
هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1980
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90027-4