New answers tagged

2 votes

Are there any other language classes of time complexity between the P language class and the NP language class?

PMar's answer is correct. Having said that, there are several language classes "between" $P$ and $NP$. An example is $RP$, the class of languages accepted in randomised polynomial time. A ...
  • 19.9k

Top 50 recent answers are included