Pages that link to "Item:Q3656204"
From MaRDI portal
The following pages link to Progress on Polynomial Identity Testing - II (Q3656204):
Displayed 32 items.
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- On division polynomial PIT and supersingularity (Q1623917) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← 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)
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- An improved finiteness test and a systematic procedure to compute the strong \(\mathscr{H}_2\) norm of differential algebraic systems with multiple delays (Q2166005) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
- Learning algebraic decompositions using Prony structures (Q2182612) (← links)
- A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Sampling Algebraic Varieties for Sum of Squares Programs (Q4594913) (← links)
- (Q4612482) (← links)
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing (Q4634059) (← links)
- (Q5002729) (← links)
- (Q5028363) (← links)
- The Multivariate Schwartz--Zippel Lemma (Q5071095) (← links)
- A generalized sylvester-gallai type theorem for quadratic polynomials (Q5092455) (← links)
- (Q5092488) (← links)
- Emptiness Problems for Integer Circuits (Q5111247) (← links)
- (Q5121898) (← links)
- Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Algebraic independence in positive characteristic: A $p$-adic calculus (Q5420121) (← 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)