Hierarchy of complexity of computation of partial functions with values 0 and 1 (Q1149431): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hierarchies of Turing machines with restricted tape alphabet size / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4131025 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Techniques for separating space complexity classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relating refined space complexity classes / 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: The Operator Gap / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A hierarchy for nondeterministic time complexity / rank | |||
Normal rank |
Latest revision as of 11:32, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hierarchy of complexity of computation of partial functions with values 0 and 1 |
scientific article |
Statements
Hierarchy of complexity of computation of partial functions with values 0 and 1 (English)
0 references
1981
0 references
complexity classes
0 references
partial functions
0 references
Turing machine
0 references