Pages that link to "Item:Q1276170"
From MaRDI portal
The following pages link to Nondeterministic \(NC^1\) computation (Q1276170):
Displaying 10 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)
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) (Q1759656) (← links)
- Functions computable in polynomial space (Q1775891) (← links)
