We study sets that are truth-table reducible to sparse sets in polynomial time. The principal results are as follows: (1) For every integer k > 0 , there is ...
Thus, the class of sets that are bounded truth-table reducible to sparse sets can be decomposed into a properly infinite hierarchy based on bounding the number ...
We study sets that are truth-table reducible to sparse sets in polynomial time. The principal results are as follows: (1) For every integer $k > 0$, there is a ...
On polynomial time one-truth-table reducibility to a sparse set
www.sciencedirect.com › article › pii
In this paper, we measure “intractability” of complexity classes by considering polynomial time 1-truth-table reducibility (in short, ≤1−ttP-reducibility) ...
By considering functions computable deterministi- cally in polynomial space, one can define the various truth- table reducibilities computable deterministically ...
On sets truth-table reducible to sparse sets · Contents. SIAM Journal on Computing. Volume 17, Issue 5 · PREVIOUS ARTICLE. Deferred data structuring. Previous ...
We furthermore show that if SAT disjunctive truth-table (or majority truth-table) reduces to a sparse set then SAT many-one reduces to LT1 and hence a collapse ...
2-truth-table reducible to sparse sets are truth-table equivalent to sparse sets. ... to sparse sets are indeed disjunctive truth-table reducible to sparse sets.
Abstract. We study the consequences of NP having non-uniform poly- nomial size circuits of various types. We continue the work of Agrawal.
We study sets that are truth-table reducible to sparse sets in polynomial time. The principal results are as follows: (1) For every integer $k > 0$, there is a ...