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.
What variable is associated with all problems solved within logarithmic space? Though unkown, what are the most commonly ascribed attributes of L in relation to P What lies between L and P that prevents a definitive determination of the relationship between L and P? What are two complexity classes between L and P? What is unknown about the complexity classes between L and P that further prevents determining the value relationship between L and P?