Talk:Space complexity
![]() | This ![]() It is of interest to the following WikiProjects: | |||||||||||||||||
|
Creating a valid Space Complexity Page
[edit]Hi, I would argue that since time complexity has its own page, it would make sense to mirror that with a complete page on space complexity. That, or it should be incorporated into time complexity's page. There doesn't seem to be enough specific discussion in the algorithm complexity page about space concerns.
Examples would be nice / very theoretical ?
[edit]This page is highly theoretical and doesn't give an intuitive understanding of space complexity. I suggest adding examples to make this more clear — Preceding unsigned comment added by Brainstudent87 (talk • contribs) 17:40, 4 November 2019 (UTC)
Needs formal definition and clarification
[edit]It would be useful in the top sections to have a formal definition of space complexity (and honestly on time complexity) from a theoretical point of view. What's more, the final section on Auxiliary Complexity seems to contradict the sections before it; since a class like LOGSPACE can't exist if the input is considered part of the space used by an algorithm, having a specific section that implies that the 'usual' definition would consider input as part of the space used (since otherwise the space would hardly be considered auxiliary) feels off and at the very least needs some clarification. — Preceding unsigned comment added by 73.83.145.112 (talk) 17:10, 20 January 2023 (UTC)
- Start-Class vital articles
- Wikipedia level-5 vital articles
- Wikipedia vital articles in Mathematics
- Start-Class level-5 vital articles
- Wikipedia level-5 vital articles in Mathematics
- Start-Class vital articles in Mathematics
- Start-Class Computer science articles
- Mid-importance Computer science articles
- WikiProject Computer science articles