context: Similarly, it is not known if L (the set of all problems that can be solved in logarithmic space) is strictly contained in P or equal to P. Again, there are many complexity classes between the two, such as NL and NC, and it is not known if they are distinct or equal classes.
question: L మరియు P మధ్య సంబంధం యొక్క ఖచ్చితమైన నిర్ణయాన్ని నిరోధించే L మరియు P మధ్య ఏమి ఉంది?
answers: complexity classes many complexity classes many complexity classes