Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > TAYFUN PAY:
All reports by Author Tayfun Pay:

TR18-166 | 18th September 2018
Tayfun Pay, James Cox

An overview of some semantic and syntactic complexity classes

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.

more >>>



ISSN 1433-8092 | Imprint