Effective guessing has unlikely consequences
MetadataShow full item record
A classic result of Paul, Pippenger, Szemeredi and Trotter states that DTIME(n) ⊊ NTIME(n). The natural question then arises: could the inclusion DTIME(t (n)) ⊆ NTIME(n) hold for some superlinear time-constructible function t(n)? If such a function t(n) does exist, then there also exist effective nondeterministic guessing strategies to speed up deterministic computations. In this work, we prove limitations on the effectiveness of nondeterministic guessing to speed up deterministic computations by showing that the existence of effective nondeterministic guessing strategies would have unlikely consequences. In particular, we show that if a subpolynomial amount of nondeterministic guessing could be used to speed up deterministic computation by a polynomial factor, then P ⊊ NTIME(n). Furthermore, even achieving a logarithmic speedup at the cost of making every step nondeterministic would show that SAT ∈ NTIME(n) under appropriate encodings. Of possibly independent interest, under such encodings we also show that SAT can be decided in O(n log n) steps on a nondeterministic multitape Turing machine, improving on the well-known O(n(log n)c) bound for some constant but undetermined exponent c ≥ 1.
Salamon , A Z & Wehar , M 2023 , ' Effective guessing has unlikely consequences ' , Theory of Computing Systems , vol. 67 , pp. 548-568 . https://doi.org/10.1007/s00224-023-10119-x
Theory of Computing Systems
Copyright © The Author(s) 2023. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
DescriptionFunding: EPSRC Grant number EP/P015638/1.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.