On the Computational Complexity of Algorithms.

Hartmanis, J., & Stearns, R. E. (1965). On the Computational Complexity of Algorithms. Transactions of the American Mathematical Society, 285-306.

Type

Journal article

Intellectual base

Primary research

Year

1965

DOI

10.1090/s0002-9947-1965-0170805-7

Link

https://doi.org/10.1090/S0002-9947-1965-0170805-7

Cited from

computer_science

Cited by

2 citations across 2 artifacts.

Primes

• Algorithm
  • The time-and-space resource bounds (Hartmanis & Stearns, 1965)

Domain-specific

• Padding argument
  • A padding argument encodes instances with additional noninformative symbols so computation measured against the longer input converts a presumed class relation into a relation at a larger time or space scale.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:55bfdc47d0b7 · see in the full table