The Intrinsic Computational Difficulty of Functions.

Cobham, A. (1965). The Intrinsic Computational Difficulty of Functions. Logic, Methodology and Philosophy of Science II: Proceedings of the 1964 International Congress, 24-30.

Type

Conference paper

Intellectual base

Primary research

Year

1965

Link

no authoritative link yet

Cited from

mathematics

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Function (Mapping)
  • Algorithms are procedures that compute functions; the same function may have many algorithms of different complexity classes

    This sourceFounding articulation of polynomial-time as the boundary of feasible computation. Independent articulation: Edmonds, Jack. "Paths, Trees, and Flowers." Canadian Journal of Mathematics 17 (1965): 449–467, DOI 10.4153/CJM-1965-045-4.

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:34c457839901 · see in the full table