Concepts inThe circuit value problem is log space complete for P
FL (complexity)
In computational complexity theory, the complexity class FL is the set of function problems which can be solved by a deterministic Turing machine in a logarithmic amount of memory space. As in the definition of L, the machine reads its input from a read-only tape and writes its output to a write-only tape; the logarithmic space restriction applies only to the read/write working tape.
more from Wikipedia
P-complete
In complexity theory, the notion of P-complete decision problems is useful in the analysis of both: which problems are difficult to parallelize effectively, and; which problems are difficult to solve in limited space. Formally, a decision problem is P-complete if it is in P and that every problem in P can be reduced to it by using an appropriate reduction. The specific type of reduction used varies and may affect the exact set of problems.
more from Wikipedia
P (complexity)
In computational complexity theory, P, also known as PTIME or DTIME(n), is one of the most fundamental complexity classes. It contains all decision problems which can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time.
more from Wikipedia
Complete metric space
In mathematical analysis, a metric space M is called complete (or a Cauchy space) if every Cauchy sequence of points in M has a limit that is also in M or, alternatively, if every Cauchy sequence in M converges in M. Intuitively, a space is complete if there are no "points missing" from it (inside or at the boundary). For instance, the set of rational numbers is not complete, because e.g.
more from Wikipedia