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: if they are distinct or equal classes if they are distinct or equal classes if they are distinct or equal classes