A relationship between difference hierarchies and relativized polynomial hierarchies
نویسندگان
چکیده
منابع مشابه
Hierarchies of Relativized Time - Bounded
Some results on relativized time-bounded complexity classes are presented. There can be many kinds of hierarchies of complexity subclasses of relativized NP. For brevity, let P(A, k) \NP(A, k)} be the relativized complexity class DTIME^(/i*) [resp. NTIME^/i*)] with respect to oracle set A. (For k=l, replace n by 2ri). Then for example: 1). There is an oracle set A such that for all k>Q P(A, k) ...
متن کاملSome Results on Relativized Deterministic and Nondeterministic Time Hierarchies
Relativized forms of deterministic and nondeterministic time complexity classes are considered. It is shown, at variance with recently published observations, that one basic step by step simulation technique in complexity theory does not relativize (i.e., does not generalize to computations with oracles), using the current definitions for time and space complexity of oracle computations. A new ...
متن کاملHyper-Polynomial Hierarchies and the NP-Jump
Assuming that the polynomial hierarchy (PH) does not collapse, we show the existence of ascending sequences of ptime Turing degrees of length !CK 1 all of which are in PSPACE and uniformly hard for PH, such that successors are NP-jumps of their predecessors. This is analgous to the hyperarithmetic hierarchy, which is defined similarly but with the (recursive) Turing degrees. The lack of uniform...
متن کاملOn the Relationship between Environmental Noise and Modular Hierarchies
In the context of developmental representations, hierarchical modular composition is often cited as a requisite for scalable complexity, particularly in the presence of noise and error during development. In earlier work of ours (Rieffel & Pollack 2006), we demonstrated the ability of a modular representation to overcome errors due to noise in an Evolutionary Developmental system. In this paper...
متن کاملPolynomial-time Construction of Contraction Hierarchies
In this paper we consider a variant of the multi-criteria shortest path problem where the different criteria are combined in an arbitrary conic combination at query time. We show that contraction hierarchies (CH) a very powerful speedup technique originally developed for standard shortest path queries (Geisberger et al. 2008) can be adapted to this scenario and lead after moderate preprocessing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Systems Theory
سال: 1993
ISSN: 0025-5661,1433-0490
DOI: 10.1007/bf01371729