published by Tishreen University
in 2017
in Informatics Engineering
and research's language is
العربية
Download
Abstract in English
P-NP-problem is the most important issue in computing theory and computational
complexity,Through her study has been defined and studied the ranks of other complexity such
ascoNP, PP, P ..
In this paper we have defined new complexity classes for polynomial time non deterministic
Turing Machine using prime and composite numbers for k-prime numbers.
References used
GUNDERMANN T.; NASSER N. A., WECHSUNG G.; "A survey on counting classes"; In Proceedings, Fifth Annual Structure in Complexity Theory Conference, pages 140-153, Barcelona, Spain, 8-11 July 1990. IEEE Computer Society Press
COOK S. A. "The complexity of theorem-proving procedures", in Proceedings of the third annual ACM symposium on Theory of computing, STOC ’71, ACM, New York, NY, USA, 1971, pp. 151–158
BERMAN L., HARTMANIS J., "On isomorphism and density of NP and other complete sets", SIAMJC6(1977), 305-322