Inductive counting below logspace (Q5096885): Difference between revisions

@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Two Applications of Inductive Counting for Complementation Problems
+Normal rank
@@ Property / cites work @@
+The alternation hierarchy for sublogarithmic space is infinite
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy that does not collapse : alternations in low level space
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Turing machines that take advice
@@ Property / cites work: Turing machines that take advice / rank @@
+Normal rank
@@ Property / cites work @@
+Q4725752
@@ Property / cites work: Q4725752 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281504
@@ Property / cites work: Q4281504 / rank @@
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank