On “provable” analogs of and (Q4191606): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Theodore P. Baker / rank | |||
Property / author | |||
Property / author: Theodore P. Baker / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
Revision as of 02:10, 13 June 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