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):
Displaying 32 items.
- Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) (Q1759656) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Skew circuits of small width (Q2173307) (← links)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Dual VP classes (Q2410687) (← links)
- Complexity of regular functions (Q2424670) (← links)
- Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
- Improved bounds for reduction to depth 4 and depth 3 (Q2514141) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- Testing properties of functions on finite groups (Q2830241) (← links)
- Lower bounds for non-commutative skew circuits (Q2830870) (← links)
- The Complexity of Bounded Register and Skew Arithmetic Computation (Q2920493) (← links)
- Evaluating Matrix Circuits (Q3196387) (← links)
- Lower Bounds for Sums of Powers of Low Degree Univariates (Q3448839) (← links)
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (Q3618608) (← links)
- (Q4612482) (← links)
- (Q5090938) (← links)
- Towards Optimal Depth Reductions for Syntactically Multilinear Circuits (Q5091237) (← links)
- (Q5111256) (← links)
- Integer circuit evaluation is PSPACE-complete (Q5956016) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)
- Cyclotomic identity testing and applications (Q6666517) (← links)
