View in EDS HTML Full Text

Space Saver.

Saved in:
Bibliographic Details
Title: Space Saver.
Authors: Springer, Max (AUTHOR)
Source: Scientific American. Sep2025, Vol. 333 Issue 2, p15-16. 2p. 1 Cartoon or Caricature.
Subjects: Computational complexity, Computer memory management, Massachusetts Institute of Technology, University research, Technological innovations, Computer science conferences, Computer performance
Abstract: The article discusses a significant breakthrough in computational complexity, revealing that problems solvable in time \( t \) can require only about \( \sqrt{t} \) bits of memory, rather than the previously assumed \( t \) bits. This finding, presented by a computer scientist from the Massachusetts Institute of Technology at the ACM Symposium on Theory of Computing, challenges long-held beliefs about the relationship between computation steps and memory usage. The breakthrough utilizes a mathematical technique called "reduction," which allows for the transformation of one problem into another, demonstrating that efficient memory use can drastically reduce the space needed for computation. This advancement suggests that the key to improving computational efficiency lies in optimizing memory usage rather than merely increasing memory capacity. [Extracted from the article]
Copyright of Scientific American is the property of Scientific American and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Psychology and Behavioral Sciences Collection
Full text is not displayed to guests.
FullText Text:
  Availability: 1
Header DbId: pbh
DbLabel: Psychology and Behavioral Sciences Collection
An: 187177487
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Space Saver.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Springer%2C+Max%22">Springer, Max</searchLink> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Scientific+American%22">Scientific American</searchLink>. Sep2025, Vol. 333 Issue 2, p15-16. 2p. 1 Cartoon or Caricature.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+memory+management%22">Computer memory management</searchLink><br /><searchLink fieldCode="DE" term="%22Massachusetts+Institute+of+Technology%22">Massachusetts Institute of Technology</searchLink><br /><searchLink fieldCode="DE" term="%22University+research%22">University research</searchLink><br /><searchLink fieldCode="DE" term="%22Technological+innovations%22">Technological innovations</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+science+conferences%22">Computer science conferences</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+performance%22">Computer performance</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The article discusses a significant breakthrough in computational complexity, revealing that problems solvable in time \( t \) can require only about \( \sqrt{t} \) bits of memory, rather than the previously assumed \( t \) bits. This finding, presented by a computer scientist from the Massachusetts Institute of Technology at the ACM Symposium on Theory of Computing, challenges long-held beliefs about the relationship between computation steps and memory usage. The breakthrough utilizes a mathematical technique called "reduction," which allows for the transformation of one problem into another, demonstrating that efficient memory use can drastically reduce the space needed for computation. This advancement suggests that the key to improving computational efficiency lies in optimizing memory usage rather than merely increasing memory capacity. [Extracted from the article]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Scientific American is the property of Scientific American and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=pbh&AN=187177487
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 2
        StartPage: 15
    Subjects:
      – SubjectFull: Computational complexity
        Type: general
      – SubjectFull: Computer memory management
        Type: general
      – SubjectFull: Massachusetts Institute of Technology
        Type: general
      – SubjectFull: University research
        Type: general
      – SubjectFull: Technological innovations
        Type: general
      – SubjectFull: Computer science conferences
        Type: general
      – SubjectFull: Computer performance
        Type: general
    Titles:
      – TitleFull: Space Saver.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Springer, Max
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 00368733
          Numbering:
            – Type: volume
              Value: 333
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Scientific American
              Type: main
ResultId 1