Gradually intractable problems and nondeterministic log-space lower bounds (Q3700836): Difference between revisions

@@ Property / cites work @@
+Some combinatorial game problems require Ω(             <i>               n               <sup>k</sup>             </i>             ) time
+Normal rank
@@ Property / cites work @@
+On two-way multihead automata
@@ Property / cites work: On two-way multihead automata / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+New problems complete for nondeterministic log space
+Normal rank
@@ Property / cites work @@
+Classes of Pebble Games and Complete Problems
@@ Property / cites work: Classes of Pebble Games and Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Transformational methods and their application to complexity problems
+Normal rank
@@ Property / cites work @@
+Q4133144
@@ Property / cites work: Q4133144 / rank @@
+Normal rank
@@ Property / cites work @@
+Relating refined space complexity classes
@@ Property / cites work: Relating refined space complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+Techniques for separating space complexity classes
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01699467
+Normal rank
@@ Property / OpenAlex ID @@
+W2010217280
@@ Property / OpenAlex ID: W2010217280 / rank @@
+Normal rank