Hierarchy of complexity of computation of partial functions with values 0 and 1 (Q1149431): Difference between revisions

@@ Property / author @@
-Q937901
@@ Property / author: Q937901 / rank @@
-Normal rank
@@ Property / author @@
+Anatoly Petrivich Beltiukov
@@ Property / author: Anatoly Petrivich Beltiukov / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Tape Simulation of Multitape Turing Machines
@@ Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchies of Turing machines with restricted tape alphabet size
+Normal rank
@@ Property / cites work @@
+Q4131025
@@ Property / cites work: Q4131025 / rank @@
+Normal rank
@@ Property / cites work @@
+Techniques for separating space complexity classes
+Normal rank
@@ Property / cites work @@
+Relating refined space complexity classes
@@ Property / cites work: Relating refined space complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+A Machine-Independent Theory of the Complexity of Recursive Functions
+Normal rank
@@ Property / cites work @@
+The Operator Gap
@@ Property / cites work: The Operator Gap / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy for nondeterministic time complexity
@@ Property / cites work: A hierarchy for nondeterministic time complexity / rank @@
+Normal rank