PolyL
In computational complexity theory, polyL is the complexity class of decision problems that can be solved on a deterministic Turing machine by an algorithm whose space complexity is bounded by a polylogarithmic function in the size of the input. In other words, polyL = DSPACE((log n)O(1)), where n denotes the input size, and O(1) denotes a constant.
Link from a Wikipage to another Wikipage
primaryTopic
PolyL
In computational complexity theory, polyL is the complexity class of decision problems that can be solved on a deterministic Turing machine by an algorithm whose space complexity is bounded by a polylogarithmic function in the size of the input. In other words, polyL = DSPACE((log n)O(1)), where n denotes the input size, and O(1) denotes a constant.
has abstract
En complejidad computacional, ...... parte, sabemos que polyL ≠ P.
@es
En teoria de la complexitat, l ...... ntrada i O(1) és una constant.
@ca
In computational complexity th ...... s the space hierarchy theorem.
@en
在計算複雜度理論內，PolyL是一個決定性問題的複雜度類， ...... 約為DSPACE((log n)k)，而違背了空間譜系理論。
@zh
Wikipage page ID
26,953,472
page length (characters) of wiki page
Wikipage revision ID
545,886,491
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
comment
En complejidad computacional, ...... parte, sabemos que polyL ≠ P.
@es
En teoria de la complexitat, l ...... ntrada i O(1) és una constant.
@ca
In computational complexity th ...... , and O(1) denotes a constant.
@en
在計算複雜度理論內，PolyL是一個決定性問題的複雜度類， ...... 約為DSPACE((log n)k)，而違背了空間譜系理論。
@zh
label
PolyL (Complexitat)
@ca
PolyL
@en
PolyL
@es
PolyL
@zh