Actions

Information for "DSPACE"

Basic information

Display titleDSPACE
Default sort keyDSPACE
Page length (in bytes)6,922
Page ID658520
Page content languageEnglish



{{#invoke:Hatnote|hatnote}} {{ safesubst:#invoke:Unsubst||$N=Refimprove |date=__DATE__ |$B= {{#invoke:Message box|ambox}} }}

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.


DSPACE sections
Intro  Complexity classes  Machine models  Hierarchy Theorem  Relation with other complexity classes  References  External links  

PREVIOUS: IntroNEXT: Complexity classes
<<>>
Page content modelwikitext
Indexing by robotsAllowed
Number of views7
Number of redirects to this page1

Page protection

EditAllow all users
MoveAllow all users

Edit history

Page creatorSrednuas Lenoroc (Talk | contribs)
Date of page creation09:54, 9 June 2015
Latest editorSrednuas Lenoroc (Talk | contribs)
Date of latest edit09:54, 9 June 2015
Total number of edits1
Total number of distinct authors1
Recent number of edits (within past 91 days)0
Recent number of distinct authors0