An Overview Of Some Semantic And Syntactic Complexity Classes
Computational Complexity
2018-06-12 v1
Abstract
We review some semantic and syntactic complexity classes that were introduced to better understand the relationship between complexity classes P and NP. We also define several new complexity classes, some of which are associated with Mersenne numbers, and show their location in the complexity hierarchy.
Cite
@article{arxiv.1806.03501,
title = {An Overview Of Some Semantic And Syntactic Complexity Classes},
author = {James L. Cox and Tayfun Pay},
journal= {arXiv preprint arXiv:1806.03501},
year = {2018}
}