This is an old revision of this page, as edited by SmackBot (talk | contribs) at 14:08, 17 December 2009 (remove Erik9bot category,outdated, tag and general fixes). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
 | This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "L/poly" – news · newspapers · books · scholar · JSTOR (December 2009) (Learn how and when to remove this message) |
 | This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (November 2006) |
L/poly is the complexity class of logarithmic space machines with a polynomial amount of advice. It is defined similarly to the more-well-known class P/poly.
It can be shown that L/poly is equivalent to uniform polyBP, the class of uniform polynomial-sized branching programs.
| P ≟ NP | This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it. |
