Pages that link to "Item:Q3521908"
From MaRDI portal
The following pages link to Diagonal Circuit Identity Testing and Lower Bounds (Q3521908):
Displaying 20 items.
- Read-once polynomial identity testing (Q496300) (← links)
- Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
- Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
- Linear projections of the Vandermonde polynomial (Q2330107) (← links)
- On the limits of depth reduction at depth 3 over small finite fields (Q2407087) (← links)
- Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- Recent Results on Polynomial Identity Testing (Q3007643) (← links)
- (Q5002729) (← links)
- (Q5028363) (← links)
- (Q5092463) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)
- Schur polynomials do not have small formulas if the determinant does not (Q6113104) (← links)