Pages that link to "Item:Q2999861"
From MaRDI portal
The following pages link to An Almost Optimal Rank Bound for Depth-3 Identities (Q2999861):
Displaying 12 items.
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← links)
- Improved Bounds for Reduction to Depth 4 and Depth 3 (Q2849964) (← links)
- Algebraic Independence and Blackbox Identity Testing (Q3012915) (← links)
- Lower bounds for Clifford indices in rank three (Q3068826) (← links)
- (Q4612482) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)