Q4182501 (Q4182501): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On complexity properties of recursively enumerable sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4082296 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Almost Everywhere Complex Recursive Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Overview of the Theory of Computational Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Reducibility to Complex or Sparse Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank |
Latest revision as of 00:24, 13 June 2024
scientific article; zbMATH DE number 3619885
Language | Label | Description | Also known as |
---|---|---|---|
English | No label defined |
scientific article; zbMATH DE number 3619885 |
Statements
1976
0 references
Speed-Up
0 references
Decidable
0 references
Axiomatizable
0 references
Formal Theories
0 references
Theorem Proving
0 references
Complexity of Proofs
0 references
Algorithm
0 references