Lesson plan
PL (complexity)
PL, or probabilistic L, is the class of languages recognizable by a polynomial time logarithmic space randomized machine with probability > (this is called unbounded error). Equivalently, as shown below, PL is the class of languages recognized by unbounded time unbounded error logspace randomized machine. An example of PL complete problem (under logspace reduction) is finding whether the determinant of a matrix (with integral coefficients) is positive. Given a matrix and a number , testing with |M|>n is also PL complete. By contrast, testing whether matrix permanent is positive is PP complete. PL PL =PL in the sense that for every f in PL, PL is unchanged if it is extended to allow as a subroutine, where A is the input string. PL contains NL and BPL and is contained in NC 2 .
Article summary
PL, or probabilistic L, is the class of languages recognizable by a polynomial time logarithmic space randomized machine with probability > (this is called unbounded error). Equivalently, as shown below, PL is the class of languages recognized by unbounded time unbounded error logspace randomized machine. An example of PL complete problem (under logspace reduction) is finding whether the determinant of a matrix (with integral coefficients) is positive. Given a matrix and a number , testing with |M|>n is also PL complete. By contrast, testing whether matrix permanent is positive is PP complete. PL PL =PL in the sense that for every f in PL, PL is unchanged if it is extended to allow as a subroutine, where A is the input string. PL contains NL and BPL and is contained in NC 2 .
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.