Intermediate
Theory of Computation
Q65 / 100
What is the space complexity class L (LOGSPACE)?
Correct! Well done.
Incorrect.
The correct answer is B) Problems decidable using O(log n) working space (not counting input)
B
Correct Answer
Problems decidable using O(log n) working space (not counting input)
Explanation
L = DSPACE(log n): problems solvable with O(log n) extra workspace. L ⊆ P. Graph reachability (STCON) is NL-complete (nondeterministic logspace). L vs NL is open.
Progress
65/100