RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness

@article{Hemaspaandra1998RSN1ttNPDR,
title={RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness},
author={Edith Hemaspaandra and Lane A. Hemaspaandra and Harald Hempel},
journal={Theory of Computing Systems},
year={1998},
volume={31},
pages={307-325}
}
• Published 1998
• Mathematics, Computer Science
• Theory of Computing Systems
Abstract. Do complexity classes have many-one complete sets if and only if they have Turing-complete sets? We prove that there is a relativized world in which a relatively natural complexity class—namely, a downward closure of NP, ${{\rm R}_{1\mbox{-}{tt}}^{\cal SN}({\rm NP})}$ —has Turing-complete sets but has no many-one complete sets. In fact, we show that in the same relativized world this class has 2-truth-table complete sets but lacks 1-truth-table complete sets. As part of the… Expand
12 Citations
R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness
• Computer Science, Mathematics
• ArXiv
• 1999
It is proved that a relatively natural complexity class, \rsnnp - a downward closure of NP, has Turing-complete sets but has no many-one complete sets, and it is shown that in the same relativized world this class has 2-truth-table complete sets but lacks 1- Truth- table complete sets. Expand
Reductions between disjoint NP-pairs
• Computer Science, Mathematics
• Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
• 2004
It is shown that under the reasonable assumption UP /spl cap/ co-UP has a P-bi-immune set that there exist disjoint NP-pairs such that (A,B) is truth-table reducible to (C,D), but there is no smart reduction between them. Expand
Reductions between disjoint NP-pairs
• Mathematics
• 2004
Razborov (1994) proved that existence of an optimal proof system implies existence of a many-one complete disjoint NP-pair. Kobler, Messner, and Toran (2003) defined a stronger form of many-oneExpand
Query Order in the Polynomial Hierarchy
• Mathematics, Computer Science
• FCT
• 1997
It is proved that all leaf language classes---and thus essentially all standard complexity classes---inherit all order-obliviousness results that hold for P. Expand
Self-Specifying Machines
• Mathematics, Computer Science
• Int. J. Found. Comput. Sci.
• 1999
The computational power of machines that specify their own acceptance types are studied, and it is shown that they accept exactly the languages in R^(#P)_m(NP). Expand
An Introduction to Query Order
• Mathematics, Computer Science
• Bull. EATCS
• 1997
The study of query order has yielded dividends in seemingly unrelated areas, such as bottleneck computations and downward translation of equality, and some of the central results are presented. Expand
Query Order and the Polynomial Hierarchy
• Computer Science, Mathematics
• J. Univers. Comput. Sci.
• 1998
It is proved that all leaf language classes - and thus essentially all standard complexity classes - inherit all order-obliviousness results that hold for P. complexity levels, and it is shown that these ordered query classes form new levels in the polynomial hierarchy unless the poynomial hierarchy collapses. Expand
The Computational Complexity Column
• 1998
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams' proof that NEXP 6⊆ ACC, which proceedsExpand
Translating Equality Downwards
• Mathematics, Computer Science
• ArXiv
• 1999
A much broader downward translation of equality is provided that subsumes not only that downward translation but also that translation that was obtained that applied to the polynomial hierarchy to bounded access to its levels by Buhrman and Fortnow. Expand
Multimode Control Attacks on Elections
• Computer Science
• IJCAI
• 2009
This paper model and study the case in which the attacker launches a multipronged (i.e., multimode) attack, and proves that for various election systems even such concerted, flexible attacks can be perfectly planned in deterministic polynomial time. Expand

References

SHOWING 1-10 OF 63 REFERENCES
RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness
• Mathematics, Computer Science
• CIAC
• 1997
It is proved that R 1−tt SN (NP) has many equivalent forms having to do with ordered and parallel access to NP and NP ∩ coNP. Expand
Polynomial Time Enumeration Reducibility
• A. Selman
• Mathematics, Computer Science
• SIAM J. Comput.
• 1978
In this chapter, a viable polynomial time enumeration reducibility is defined and studied, and a maximal transitive subrelation of $\leqq _{{\text{pe}}}$ is shown, which is intrinsic to certain tradeoffs between nondeterministic oracles recognition of sets and deterministic oracle computations between functions. Expand
Query Order
• Physics, Computer Science
• SIAM J. Comput.
• 1998
Unless the polynomial hierarchy collapses it holds that, for each $1\leq j \leq k$, the languages computable via aPolynomial-time machine given one query to the fifth level of the boolean hierarchy are computable. Expand
Banishing Robust Turing Completeness
• Mathematics, Computer Science
• LFCS
• 1992
It is shown that “promise classes” are so fragilely structured that they do not robustly possess Turing-hard sets even in classes far larger than themselves, and the range of classes known not to robustly contain many-one complete sets is extended. Expand
The Boolean Hierarchy I: Structural Properties
The complexity of sets formed by boolean operations (union, intersection, and complement) on NP sets are studied, showing that in some relativized worlds the boolean hierarchy is infinite, and that for every k there is a relativization world in which the Boolean hierarchy extends exactly k levels. Expand
Cook Reducibility is Faster than Karp Reduciblity in NP
• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 1990
Abstract It is unknown whether Cook reducibility of a set A to a set B —that is reduction of A to B via a Turing machine operating in polynomial time with “free” procedural calls to an algorithm forExpand
On polynomial time Turing and many-one completeness in PSPACE
• Mathematics, Computer Science
• [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
• 1989
Machinery that uses this difference between the power of the latter and that of polynomial-time-Turing-reducibility for separating the two kinds of completeness in PSPACE is established. Expand
On reductions of NP sets to sparse sets
• Mathematics, Computer Science
• [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
• 1991
The authors simplify their proof, strengthen the result, and use it to obtain several new results, which include applications of the main theorem to log-truth-table and log-Turing reductions of NP sets to sparse sets. Expand
Bounded Query Classes
• K. Wagner
• Mathematics, Computer Science
• SIAM J. Comput.
• 1990
The Boolean hierarchy is generalized in such a way that it is possible to characterize P and O in terms of the generalization, and the class $P^{\text{NP}}[O(\log n)]$ can be characterized in very different ways. Expand
Complexity Classes Without Machines: On Complete Languages for UP
• Mathematics, Computer Science
• ICALP
• 1986
Techniques for studying complexity classes that are not covered by known recursive enumerations of machines are developed by using them to examine the probabilistic class BPP and it is shown that there is a relativized world where BPPA has no complete languages. Expand