Abstract
In this paper we propose, and analyze from the computational complexity point of view, a new variant of nondeterministic Turing machines. Such a machine accepts a given input word if and only if one of its shortest possible computations on that word is accepting; on the other hand, the machine rejects the input word when all the shortest computations performed by the machine on that word are rejecting. Our main results are two new characterizations of P NP[log] and P NP in terms of the time complexity classes defined for such machines.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hartmanis, J., Stearns, R.E.: On the Computational Complexity of Algorithms. Trans. Amer. Math. Soc. 117, 533–546 (1965)
Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Exact analysis of Dodgson elections: Lewis Carroll’s 1876 voting system is complete for parallel access to NP. J. ACM 44(6), 806–825 (1997)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Manea, F.: Deciding According to the Shortest Computations. Tech. rep., Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik (2011), http://theo.cs.uni-magdeburg.de/pubs/preprints/pp-afl-2011-02.pdf
Manea, F., Margenstern, M., Mitrana, V., Pérez-Jiménez, M.J.: A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors. Theory Comput. Syst. 46(2), 174–192 (2010)
Papadimitriou, C.M.: Computational complexity. Addison-Wesley, Reading (1994)
Pérez–Jiménez, M.J.: A Computational Complexity Theory in Membrane Computing. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds.) WMC 2009. LNCS, vol. 5957, pp. 125–148. Springer, Heidelberg (2010)
Wagner, K.W.: More Complicated Questions About Maxima and Minima, and Some Closures of NP. Theor. Comput. Sci. 51, 53–80 (1987)
Wagner, K.W.: Bounded Query Classes. SIAM J. Comput. 19(5), 833–846 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manea, F. (2011). Deciding According to the Shortest Computations. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds) Models of Computation in Context. CiE 2011. Lecture Notes in Computer Science, vol 6735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21875-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-21875-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21874-3
Online ISBN: 978-3-642-21875-0
eBook Packages: Computer ScienceComputer Science (R0)