Pages that link to "Item:Q1276170"

The following pages link to Nondeterministic \(NC^1\) computation (Q1276170):

Displaying 31 items.

• On the power of algebraic branching programs of width two (Q260398) (← links)
• Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
• Leaf languages and string compression (Q550251) (← links)
• The algebraic theory of Parikh automata (Q722218) (← links)
• Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\) (Q764326) (← links)
• Positive and negative proofs for circuits and branching programs (Q896677) (← links)
• Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
• On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
• Tree compression using string grammars (Q1742370) (← links)
• Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) (Q1759656) (← links)
• Functions computable in polynomial space (Q1775891) (← links)
• Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
• Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
• Succinct certification of monotone circuits (Q2232601) (← links)
• On the complexity of matrix rank and rigidity (Q2268340) (← links)
• The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
• A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
• Dual VP classes (Q2410687) (← links)
• Processing succinct matrices and vectors (Q2411035) (← links)
• Complexity of regular functions (Q2424670) (← links)
• Cost Register Automata for Nested Words (Q2817901) (← links)
• Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
• A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups (Q2975255) (← links)
• On the Power of Algebraic Branching Programs of Width Two (Q3012846) (← links)
• Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity (Q3392953) (← links)
• On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata (Q3503642) (← links)
• Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae (Q3599149) (← links)
• Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q5041265) (← links)
• On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
• Parameterised counting in logspace (Q6093373) (← links)
• Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q6169898) (← links)