Pages that link to "Item:Q1274913"
From MaRDI portal
The following pages link to Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913):
Displayed 8 items.
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (Q3618608) (← links)
- Integer circuit evaluation is PSPACE-complete (Q5956016) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)