Linear independence, alternants, and applications

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A local decision test for sparse polynomials
Read-once polynomial identity testing
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
Deterministic polynomial identity tests for multilinear bounded-read formulae
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
The ideal membership problem and polynomial identity testing
Factoring sparse multivariate polynomials
A probabilistic remark on algebraic program testing
Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
Black-box identity testing of depth-4 multilinear circuits
Algebraic independence and blackbox identity testing
Queries and concept learning
Explicit subspace designs
Polynomial identity testing for depth 3 circuits
Arithmetic Circuits: A Chasm at Depth 3
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits
Improved Bounds for Reduction to Depth 4 and Depth 3
An Almost Optimal Rank Bound for Depth-3 Identities
Wronskians and Linear Independence
Arithmetic Circuits: A survey of recent results and open questions
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Combinatorial Nullstellensatz
Learning functions represented as multiplicity automata
Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter
Reconstruction of Depth-4 Multilinear Circuits
Blackbox Polynomial Identity Testing for Depth 3 Circuits
Randomness efficient identity testing of multivariate polynomials
Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials
From sylvester-gallai configurations to rank bounds
Reconstruction of depth-4 multilinear circuits with top fan-in 2
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
Constructing Faithful Homomorphisms over Fields of Finite Characteristic.
Derandomizing polynomial identity tests means proving circuit lower bounds
Polynomial time deterministic identity testing algorithm for Σ ^[3 ΠΣΠ ^[2] circuits via Edelstein–Kelly type theorem for quadratic polynomials]
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits

This page was built for publication: Linear independence, alternants, and applications