Translational lemmas, polynomial time, and \((\log n)^j\)-space (Q1225932): Difference between revisions

@@ Property / cites work @@
+On Languages Accepted in Polynomial Time
@@ Property / cites work: On Languages Accepted in Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing complexity classes
@@ Property / cites work: Comparing complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4134974
@@ Property / cites work: Q4134974 / rank @@
+Normal rank
@@ Property / cites work @@
+The Hardest Context-Free Language
@@ Property / cites work: The Hardest Context-Free Language / 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 @@
+A Note Concerning Nondeterministic Tape Complexities
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5672171
@@ Property / cites work: Q5672171 / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Q5636862
@@ Property / cites work: Q5636862 / rank @@
+Normal rank