Pages that link to "Item:Q5259623"
From MaRDI portal
The following pages link to Hitting sets for multilinear read-once algebraic branching programs, in any order (Q5259623):
Displaying 22 items.
- Higgledy-piggledy subspaces and uniform subspace designs (Q281328) (← links)
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
- Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
- Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
- Geometric complexity theory. V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- Deterministic black-box identity testing \(\pi\)-ordered algebraic branching programs (Q2908859) (← links)
- Deterministic Truncation of Linear Matroids (Q3448849) (← links)
- (Q4601834) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q4601835) (← links)
- (Q4612482) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- Towards blackbox identity testing of log-variate circuits (Q5002729) (← links)
- (Q5028363) (← links)
- (Q5092414) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 (Q5862347) (← links)
- Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)
- Variety evasive subspace families (Q6599767) (← links)
