On the computational complexity of Longley's \(H\) functional (Q1827400): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Functional interpretations of feasibly constructive arithmetic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On characterizations of the basic feasible functionals, Part I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4265595 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4337021 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The sequentially realizable functionals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: When is a functional program not a functional program? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4513585 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classical recursion theory. Vol. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4298260 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4310702 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4938567 / rank | |||
Normal rank |
Latest revision as of 19:20, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the computational complexity of Longley's \(H\) functional |
scientific article |
Statements
On the computational complexity of Longley's \(H\) functional (English)
0 references
6 August 2004
0 references
Sequential computability
0 references
Realizability
0 references
NP-hardness
0 references
Higher-type computational complexity
0 references