On relationships between complexity classes of Turing machines (Q1682916): Difference between revisions

@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4071737
@@ Property / cites work: Q4071737 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3589189
@@ Property / cites work: Q3589189 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Algorithms
@@ Property / cites work: On the Computational Complexity of Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Separating Nondeterministic Time Complexity Classes
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Q5636862
@@ Property / cites work: Q5636862 / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+On Time Versus Space
@@ Property / cites work: On Time Versus Space / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s096554251704011x
+Normal rank
@@ Property / OpenAlex ID @@
+W2615658319
@@ Property / OpenAlex ID: W2615658319 / rank @@
+Normal rank