On the Tape-Number Problem for Deterministic Time Classes
نویسنده
چکیده
For any time bound f , let H(f) denote the hierarchy conjecture which means that the restriction of the numbers of work tapes of deterministic Turing machines to b ∈ N generates an infinite hierarchy of proper subclasses DTIMEb(f) ⊂ DTIME(f). We show that H(f) implies separations of deterministic from nondeterministic time classes. H(f) follows from the gap property, G(f), which says that there is a time-constructible f2 such that f ∈ o(f2) and DTIME(f) = DTIME(f2). G(f) implies further separations. All these relationships relativize. MSC (2010): 68Q15, 03D15
منابع مشابه
Deterministic Turing Machines in the Range between Real-time and Linear-time Justus-liebig- Universit at Gieeen Deterministic Turing Machines in the Range between Real-time and Linear-time
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by such devices with time bounds of the form n + r(n) where r 2 o(n) is a sublinear function. It is shown that there exist innnite time hierarchies of separated complexity classes in that range. For these classes weak clos...
متن کاملDeterministic Turing machines in the range between real-time and linear-time
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by such devices with time bounds of the form n + r(n) where r ∈ o(n) is a sublinear function. It is shown that there exist infinite time hierarchies of separated complexity classes in that range. For these classes weak clo...
متن کاملA Robust Optimization Methodology for Multi-objective Location-transportation Problem in Disaster Response Phase under Uncertainty
This paper presents a multi-objective model for location-transportation problem under uncertainty that has been developed to respond to crisis. In the proposed model, humanitarian aid distribution centers (HADC), the number and location of them, the amount of relief goods stored in distribution centers, the amount of relief goods sent to the disaster zone, the number of injured people transferr...
متن کاملA Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases
The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...
متن کاملComparing Complexity Classes of Formal Languages
A property of polynomial complete languages is extended in order to better compare various classes of formal languages. We consider pairs (̂ ,,̂ 2̂ °̂ classes of languages such that there is a language L e 5?, with the property that L e ^if and / if &-\ Certain longstanding open questions in automata-based complexity have resurfaced recently due to the work on efficient reducibilities among combina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1309.7457 شماره
صفحات -
تاریخ انتشار 2013