PL (complexity) (original) (raw)
PL, or probabilistic L, is the class of languages recognizable by a polynomial time logarithmic space randomized machine with probability > 1⁄2 (this is called unbounded error). Equivalently, as shown below, PL is the class of languages recognized by unbounded time unbounded error logspace randomized machine. PLPL=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 NC2.
| Property | Value |
|---|---|
| dbo:abstract | PL, or probabilistic L, is the class of languages recognizable by a polynomial time logarithmic space randomized machine with probability > 1⁄2 (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 M and a number n, testing with is also PL complete. By contrast, testing whether matrix permanent is positive is PP complete. PLPL=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 NC2. (en) PL, ou L probabilístico, é a classe de linguagens reconhecíveis por uma máquina randômica de espaço logarítmico de tempo polinomial com probabilidade > 1/2 (chamado de erro ilimitado). De forma equivalente, como mostrado abaixo, PL é a classe de linguagens reconhecidas por máquinas randômizadas de tempo ilimitado e de espaço log com erro ilimitado. Um exemplo de problema PL completo (sob redução logspace) é encontrar se o determinante de uma matriz (com coeficientes inteiros) é positivo. Dados uma matriz M e um número n, testar se |M |
| dbo:wikiPageID | 48561286 (xsd:integer) |
| dbo:wikiPageLength | 4157 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1003629637 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:NC_(complexity) dbr:NL_(complexity) dbr:L_(complexity) dbr:Permanent_(mathematics) dbr:PP_(complexity) dbr:BPL_(complexity) dbc:Probabilistic_complexity_classes dbr:Markov_chain |
| dbp:wikiPageUsesTemplate | dbt:1/2 dbt:Math dbt:Mvar dbt:Reflist dbt:Tmath dbt:ComplexityClasses |
| dct:subject | dbc:Probabilistic_complexity_classes |
| gold:hypernym | dbr:Languages |
| rdf:type | dbo:Language |
| rdfs:comment | PL, or probabilistic L, is the class of languages recognizable by a polynomial time logarithmic space randomized machine with probability > 1⁄2 (this is called unbounded error). Equivalently, as shown below, PL is the class of languages recognized by unbounded time unbounded error logspace randomized machine. PLPL=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 NC2. (en) PL, ou L probabilístico, é a classe de linguagens reconhecíveis por uma máquina randômica de espaço logarítmico de tempo polinomial com probabilidade > 1/2 (chamado de erro ilimitado). De forma equivalente, como mostrado abaixo, PL é a classe de linguagens reconhecidas por máquinas randômizadas de tempo ilimitado e de espaço log com erro ilimitado. PLPL=PL no sentido de que para cada f em PL, PL é inalterada se for alargada para x→f(A,x) como uma subrotina, onde A é a string de entrada. PL contém NL e BPL , e está contida em NC2. (pt) |
| rdfs:label | PL (complexity) (en) PL (complexidade) (pt) |
| owl:sameAs | yago-res:PL (complexity) wikidata:PL (complexity) dbpedia-pt:PL (complexity) https://global.dbpedia.org/id/2AbjA |
| prov:wasDerivedFrom | wikipedia-en:PL_(complexity)?oldid=1003629637&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:PL_(complexity) |
| is dbo:wikiPageDisambiguates of | dbr:PL |
| is dbo:wikiPageWikiLink of | dbr:PL dbr:BPL_(complexity) |
| is foaf:primaryTopic of | wikipedia-en:PL_(complexity) |