Pages that link to "Item:Q2821698"
From MaRDI portal
The following pages link to Progress on Polynomial Identity Testing-II (Q2821698):
Displaying 18 items.
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← 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)
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- Learning algebraic decompositions using Prony structures (Q2182612) (← links)
- Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization (Q3295273) (← links)
- (Q4612482) (← links)
- (Q5002729) (← links)
- A generalized sylvester-gallai type theorem for quadratic polynomials (Q5092455) (← links)
- (Q5092488) (← links)
- Emptiness Problems for Integer Circuits (Q5111247) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)
- (Q6084351) (← links)
- Testing the satisfiability of algebraic formulas over the field of two elements (Q6137613) (← links)
- Hardness of graph-structured algebraic and symbolic problems (Q6179415) (← links)