On eliminating nondeterminism from Turing machines which use less than logarithm worktape space (Q1168735): Difference between revisions

@@ Property / cites work @@
+Lower bounds on space complexity for contextfree recognition
+Normal rank
@@ Property / cites work @@
+Q4144808
@@ Property / cites work: Q4144808 / 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 @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Relativization of questions about log space computability
+Normal rank
@@ Property / cites work @@
+Q3871927
@@ Property / cites work: Q3871927 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Techniques for separating space complexity classes
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of Savitch's theorem to small space bounds
+Normal rank