Counting Classes Definedby Prime Numbers

ريف صفوف تعقيد جديدة لحاسبة تورينك اللاحتمية بزمن  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, .. In this paper we have defined new complexity classes forp...

Full description

Bibliographic Details
Main Author: ناصر ناصر
Format: Article
Language:Arabic
Published: Tishreen University 2019-02-01
Series:مجلة جامعة تشرين للبحوث والدراسات العلمية، سلسلة العلوم الأساسية
Online Access:http://journal.tishreen.edu.sy/index.php/bassnc/article/view/3727