L/poly
id:
l-poly-290-15993927
title:
L/poly
text:
In computational complexity theory, L/poly is the complexity class of logarithmic space machines with a polynomial amount of advice. L/poly is a non-uniform logarithmic space class, analogous to the non-uniform polynomial time class P/poly. Formally, for a formal language L to belong to L/poly, there must exist an advice function f that maps an integer n to a string of length polynomial in n, and a Turing machine M with two read-only input tapes and one read-write tape of size logarithmic in the
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/L/poly
date created:
date modified:
2021-07-05T21:18:11Z
main entity:
{"identifier":"Q6456811","url":"https://www.wikidata.org/entity/Q6456811"}
image:
fields total:
13
integrity:
13