Read-once polynomial identity testing
From MaRDI portal
Recommendations
- Improved Polynomial Identity Testing for Read-Once Formulas
- On reconstruction and testing of read-once formulas
- Read-once polynomial identity testing
- Building above read-once polynomials: identity testing and hardness of representation
- Building above read-once polynomials: identity testing and hardness of representation
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3698383 (Why is no real title available?)
- scientific article; zbMATH DE number 2079409 (Why is no real title available?)
- A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
- A probabilistic remark on algebraic program testing
- An almost optimal rank bound for depth-3 identities
- Arithmetic circuits: a survey of recent results and open questions
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Black-box identity testing of depth-4 multilinear circuits
- Blackbox Polynomial Identity Testing for Depth 3 Circuits
- Blackbox identity testing for bounded top-fanin depth-3 circuits: the field doesn't matter
- Combinatorial Nullstellensatz
- Combinatorial characterization of read-once formulae
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Deterministic black-box identity testing \(\pi\)-ordered algebraic branching programs
- Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
- Deterministic polynomial identity testing in non-commutative models
- Diagonal Circuit Identity Testing and Lower Bounds
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- From sylvester-gallai configurations to rank bounds
- Hardness-randomness tradeoffs for bounded depth arithmetic circuits
- Hitting sets for multilinear read-once algebraic branching programs, in any order
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- Improved Polynomial Identity Testing for Read-Once Formulas
- Interpolating Arithmetic Read-Once Formulas in Parallel
- Interpolation of depth-3 arithmetic circuits with two multiplication gates
- Jacobian hits circuits: hitting-sets, lower bounds for depth-\(D\) occur-\(k\) formulas \& depth-\(3\) transcendence degree-\(k\) circuits
- Learning Arithmetic Read-Once Formulas
- Learning Boolean read-once formulas over generalized bases
- Learning read-once formulas with queries
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Lower bounds and separations for constant depth multilinear circuits
- Matching is as easy as matrix inversion
- Multi-linear formulas for permanent and determinant are of super-polynomial size
- On identity testing of tensors, low-rank recovery and compressed sensing
- On interpolating arithmetic read-once formulas with exponentiation
- PRIMES is in P
- Polynomial identity testing for depth 3 circuits
- Quasi-polynomial hitting-set for set-depth-\({\Delta}\) formulas
- Randomness efficient identity testing of multivariate polynomials
- Read-once polynomial identity testing
- Separation of multilinear circuit and formula size
- The ideal membership problem and polynomial identity testing
Cited in
(22)- Equivalence of polynomial identity testing and polynomial factorization
- Polynomial identity testing for depth 3 circuits
- Read-once polynomial identity testing
- Sums of products of polynomials in few variables: lower bounds and polynomial identity testing
- Characterizing arithmetic read-once formulae
- Improved hitting set for orbit of ROABPs
- Linear independence, alternants, and applications
- Sums of read-once formulas: how many summands are necessary?
- scientific article; zbMATH DE number 7561311 (Why is no real title available?)
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
- Deterministic polynomial identity tests for multilinear bounded-read formulae
- Beyond the Existential Theory of the Reals
- Complete derandomization of identity testing and reconstruction of read-once formulas
- On some computations on sparse polynomials
- On reconstruction and testing of read-once formulas
- scientific article; zbMATH DE number 7009617 (Why is no real title available?)
- Building above read-once polynomials: identity testing and hardness of representation
- Sums of read-once formulas: how many summands suffice?
- Building above read-once polynomials: identity testing and hardness of representation
- scientific article; zbMATH DE number 7204283 (Why is no real title available?)
- Improved Polynomial Identity Testing for Read-Once Formulas
- Isomorphism testing of read-once functions and polynomials
This page was built for publication: Read-once polynomial identity testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496300)
