Abstract
We define the time complexity of programs in an arbitrary relational system. We extend these notions to nondeterministic programs. There are certain sufficient conditions for a relational system which ensure the equivalence of the P=NP problem in that system to the classical P=NP problem for Turing machines. This implies that the problem can be solved in the theory of programs in some relational systems.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aho. Hopcroft, Ullman — The Design and Analysis of Computer Algorithms — Addison, Wesley 1974.
Salwicki — Programmability and Recursiveness, Dissertationes Mathematicae /to appear/.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Radziszowski, S. (1977). Programmability and P=NP conjecture. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_120
Download citation
DOI: https://doi.org/10.1007/3-540-08442-8_120
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08442-6
Online ISBN: 978-3-540-37084-0
eBook Packages: Springer Book Archive