Abstract
Classes of machines using very limited amounts of nondeterminism are studied. The P=? NP question is related to questions about classes lying within P. Complete sets for these classes are given.
(Extended Abstract)
Supported in part by a grant from the Natural Sciences and Engineering Research Council (NSERC) of Canada.
Supported in part by National Science Foundation grant number RII-9003056. Much of this work done while a postdoc at Dartmouth College.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. R. Abrahamson, J. A. Ellis, M. R. Fellows and M. E. Mata, “On the Complexity of Fixed Parameter Problems,” in 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1989, pp. 210–215.
K. R. Abrahamson, J. A. Ellis, M. R. Fellows and M. E. Mata, “Completeness for Families of Fixed Parameter Problems,” manuscript, 1990.
C. Àlvarez, J. Díaz and J. Torán, “Complexity Classes With Complete Problems Between P and NP-Complete,” in Foundations of Computation Theory, Lecture Notes in Computer Science 380, Springer-Verlag, 1989.
J. F. Buss and J. Goldsmith, “Nondeterminism Within P,” submitted to SIAM J. Computing, 1990.
S. R. Buss, personal communication.
S. A. Cook, “Short Propositional Formulas Represent Nondeterministic Computations,” Inform. Process. Lett. 26 (1987/88) 269–270.
J. Díaz and J. Torán, “Classes of Bounded Nondeterminism,” Math. Systems Theory 23 (1990) 21–32.
J. G. Geske, On the Structure of Intractable Sets, Ph.D. thesis, Iowa State University, 1987.
Y. Gurevich and S. Shelah, “Nearly Linear Time,” in A. R. Meyer and M. A. Taitslin, eds., Logic at Botik '89, Lecture Notes in Computer Science 363, Springer-Verlag, 1989, pp. 108–118.
H. B. Hunt III and R. E. Stearns, “The Complexity of Very Simple Boolean Formulas with Applications,” SIAM J. Computing 19 (1990) 44–70.
R. Kaye, “Characterizing some low complexity classes using theories of arithmetic,” M.Sc. thesis, University of Manchester, 1985.
C. M. R. Kintala and P. C. Fischer, “Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations,” SIAM J. Computing 9 (1980) 46–53.
N. Pippenger, “Fast Simulation of Combinational Logic Circuits by Machines without Random-Access Storage,” in Fifteenth Allerton Conference on Communication, Control, and Computing, 1977, pp. 25–33.
B. Poizat, “Q=NQ?”, J. Symbolic Logic 51 (1986) 22–32.
C. P. Schnorr, “Satisfiability is Quasilinear Complete in NQL,” J. Assoc. Comput. Mach. 25 (1978) 136–145.
M. J. Wolf, “Nondeterministic Circuits, Space Complexity and Quasigroups,” Technical report 870, Dept. of Computer Science, U. Wisconsin, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buss, J.F., Goldsmith, J. (1991). Nondeterminism within P . In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020811
Download citation
DOI: https://doi.org/10.1007/BFb0020811
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53709-0
Online ISBN: 978-3-540-47002-1
eBook Packages: Springer Book Archive