Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272): Difference between revisions

@@ Property / cites work @@
+On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
+Normal rank
@@ Property / cites work @@
+Q2743685
@@ Property / cites work: Q2743685 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-commutative arithmetic circuits: depth reduction and size lower bounds
+Normal rank
@@ Property / cites work @@
+Visibly pushdown languages
@@ Property / cites work: Visibly pushdown languages / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ 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 @@
+An Optimal Parallel Algorithm for Formula Evaluation
+Normal rank
@@ Property / cites work @@
+Nondeterministic \(NC^1\) computation
@@ Property / cites work: Nondeterministic \(NC^1\) computation / rank @@
+Normal rank
@@ Property / cites work @@
+Division in logspace-uniform<i>NC</i><sup>1</sup>
@@ Property / cites work: Division in logspace-uniform<i>NC</i><sup>1</sup> / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+Complexity theory of parallel time and hardware
@@ Property / cites work: Complexity theory of parallel time and hardware / rank @@
+Normal rank
@@ Property / cites work @@
+Q4284250
@@ Property / cites work: Q4284250 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size Boolean formulas compute exactly those functions in AC\(^ 0\)
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetizing Classes Around NC 1 and L
@@ Property / cites work: Arithmetizing Classes Around NC 1 and L / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
+Normal rank
@@ Property / cites work @@
+Q3890112
@@ Property / cites work: Q3890112 / rank @@
+Normal rank
@@ Property / cites work @@
+Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits
+Normal rank
@@ Property / cites work @@
+\(\text{RL}\subseteq \text{SC}\)
@@ Property / cites work: \(\text{RL}\subseteq \text{SC}\) / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-size bounded alternation
@@ Property / cites work: Tree-size bounded alternation / rank @@
+Normal rank
@@ Property / cites work @@
+On the Tape Complexity of Deterministic Context-Free Languages
+Normal rank
@@ Property / cites work @@
+Properties that characterize LOGCFL
@@ Property / cites work: Properties that characterize LOGCFL / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393484
@@ Property / cites work: Q4393484 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3341935
@@ Property / cites work: Q3341935 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean circuits versus arithmetic circuits
@@ Property / cites work: Boolean circuits versus arithmetic circuits / rank @@
+Normal rank