Pages that link to "Item:Q1276170"
From MaRDI portal
The following pages link to Nondeterministic \(NC^1\) computation (Q1276170):
Displayed 13 items.
- Leaf languages and string compression (Q550251) (← links)
- Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\) (Q764326) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← 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)
- 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)
- 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)