Polygonal Complexity Counting Classes
In this work we introduce new counting classes defined by special sets of natural number like Triangular, Perfect Square, Pentagonal and generally K-gonal numbers. We shall see that NP is a subclass of all complements of K-gonal classes and all K-gonal classes are subclasses of a class defined b...
Main Author: | Nasser Nasser |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
Tishreen University
2018-09-01
|
Series: | مجلة جامعة تشرين للبحوث والدراسات العلمية- سلسلة العلوم الهندسية |
Online Access: | https://journal.tishreen.edu.sy/index.php/engscnc/article/view/3905 |
Similar Items
-
Counting Classes Definedby Prime Numbers
by: Nasser Nasser
Published: (2019-02-01) -
Levels of Sophistication in Elementary Students’ Understanding of Polygon Concept and Polygons Classes
by: Melania Bernabeu, et al.
Published: (2021-08-01) -
Single Polygon Counting on Cayley Tree of Order 3
by: Pah, Chin Hee
Published: (2010) -
Descriptive Complexity for Counting Complexity Classes
by: Marcelo Arenas, et al.
Published: (2020-02-01) -
The Motion of a Point Vortex in Multiply-Connected Polygonal Domains
by: El Mostafa Kalmoun, et al.
Published: (2020-07-01)