On “provable” analogs of and (Q4191606): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Theory of Provable Recursive Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization Among Provably Equivalent Programs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01776574 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W99744800 / rank | |||
Normal rank |
Latest revision as of 11:16, 30 July 2024
scientific article; zbMATH DE number 3630222
Language | Label | Description | Also known as |
---|---|---|---|
English | On “provable” analogs of and |
scientific article; zbMATH DE number 3630222 |
Statements
On “provable” analogs of and (English)
0 references
1979
0 references
Computational Complexity
0 references
Turing Machines
0 references
Np-Complete Problems
0 references
Provability Requirements
0 references