Abstract
By endowing usual nondeterministic Turing machines with new modes of acceptance we introduce new machines whose computational power is bounded by that of alternating Turing machines making only one alternation. The polynomial time classes of these machines are exactly the levels of the Boolean closure of NP which can be defined in a natural way. For all these classes natural problems can be found which are proved to be ≤ Pm -complete in these classes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
Cook,S.A., The complexity of theorem proving procedures, Proc. of the 3rd ACM Symposium on Theory of Computing (1971), 151–158.
Garey, M.R., Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1979.
Hausdorff,F., Grundzüge der Mengenlehre, Leipzig 1914.
Papadimitriou,Ch.H., Yannakakis,M., The complexity of facets (and some facets of complexity), Proc. of the 14th ACM Symposium on Theory of Computing (1982), 255–260.
Rogers,H., Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Company New York, St. Louis, San Francisco, Toronto, London Sidney.
Wagner, Klaus, On ω-regular sets, Information and Control 43 (1979), 123–177.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wechsung, G. (1985). On the boolean closure of NP. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028832
Download citation
DOI: https://doi.org/10.1007/BFb0028832
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15689-5
Online ISBN: 978-3-540-39636-9
eBook Packages: Springer Book Archive