DSPACE
In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine. It represents the total amount of memory space that a "normal" physical computer would need to solve a given computational problem with a given algorithm. It is one of the most well-studied complexity measures, because it corresponds so closely to an important real-world resource: the amount of physical computer memory needed to run a given program.
Wikipage disambiguates
primaryTopic
DSPACE
In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine. It represents the total amount of memory space that a "normal" physical computer would need to solve a given computational problem with a given algorithm. It is one of the most well-studied complexity measures, because it corresponds so closely to an important real-world resource: the amount of physical computer memory needed to run a given program.
has abstract
DSPACE または SPACE は、計算複雑性理論における ...... ることから、最もよく研究されている複雑性の尺度の1つである。
@ja
Der Begriff DSPACE stammt aus ...... PSPACE wie folgt definiert: .
@de
Em complexidade computacional, ...... roblema com um dado algoritmo.
@pt
En teoría de la complejidad co ...... se en términos de DSPACE como:
@es
In computational complexity th ...... needed to run a given program.
@en
Wikipage page ID
Wikipage revision ID
741,693,626
hypernym
type
comment
DSPACE または SPACE は、計算複雑性理論における ...... ることから、最もよく研究されている複雑性の尺度の1つである。
@ja
Der Begriff DSPACE stammt aus ...... PSPACE wie folgt definiert: .
@de
Em complexidade computacional, ...... roblema com um dado algoritmo.
@pt
En teoría de la complejidad co ...... se en términos de DSPACE como:
@es
In computational complexity th ...... needed to run a given program.
@en
label
DSPACE
@de
DSPACE
@en
DSPACE
@es
DSPACE
@ja
DSPACE
@pt