Talk:Space–time tradeoff

This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Computing

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
???	This article has not yet received a rating on the project's importance scale.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

"Often, by exploiting a time-memory tradeoff, the complexity class of a problem can be changed altogether."

I'm not sure that this it is true. Does adding more memory usually change the complexity class? If it is true there must be many examples apart from the log-space complexity class and Blum's speedup algorithm.

"Larger code size can be traded for higher program speed when applying loop unwinding. This technique makes the code longer for each iteration of a loop, but saves the computation time required for jumping back to the beginning of the loop at the end of each iteration."

it may also save pointer/index arithmetic in many cases (or could actually increase it other cases)ken (talk) 09:04, 21 February 2010 (UTC)[reply]

Technically, program size is distinct from space complexity, referring to how many cells of storage required. But it depends on the definition of space complexity and the model of turing machine employed.

-- Hegariz —Preceding unsigned comment added by Hegariz (talk • contribs) 03:17, 20 September 2008 (UTC)[reply]

Most of the articles content is covered by Algorithmic efficiency article[edit]

I have tidied up the article but its main subject matter is already covered in the Algorithmic efficiency article. Its rendering and logarithm and similar examples are however not specifically mentioned in that article. —Preceding unsigned comment added by 81.129.35.252 (talk) 10:47, 20 December 2009 (UTC)[reply]

Oppose. Algorithmic efficiency is a vast set of loosely-related subjects. Space-time tradeoff is a fairly small and complete set of closely-related subjects. A {{main}} link is more preferable. 81.5.119.21 (talk) 22:44, 6 January 2010 (UTC)[reply]

Agree. The so called "loosely-related" subjects are of course all related to algorithmic efficiency (i.e. the whole point of the article), whereas space-time tradeoffs are just some part of this and can only be separated from the whole if the other important considerations are ignored. A holistic approach is the only realistic option to efficiency - just as a cars engine efficiency is only a part of its fuel consumption, devoid of overall weight, rolling resistance, aerodynamic design and of course its ECU programming.ken (talk) 09:04, 21 February 2010 (UTC)[reply]