Reconstruction of depth-4 multilinear circuits
From MaRDI portal
Cites work
- A probabilistic remark on algebraic program testing
- Black-box identity testing of depth-4 multilinear circuits
- Blackbox Polynomial Identity Testing for Depth 3 Circuits
- Complete derandomization of identity testing and reconstruction of read-once formulas
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Cryptographic hardness for learning intersections of halfspaces
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
- Efficient learning algorithms yield circuit lower bounds
- Efficient Reconstruction of Random Multilinear Formulas
- Exact learning algorithms, betting games, and circuit lower bounds
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- From Sylvester-Gallai configurations to rank bounds: improved black-box identity test for depth-3 circuits
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 5899249 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 799791 (Why is no real title available?)
- scientific article; zbMATH DE number 6789296 (Why is no real title available?)
- scientific article; zbMATH DE number 7829350 (Why is no real title available?)
- Improved Bounds for Reduction to Depth 4 and Depth 3
- Interpolation of depth-3 arithmetic circuits with two multiplication gates
- Learning algorithms from natural proofs
- Learning functions represented as multiplicity automata
- Learning generalized depth three arithmetic circuits in the non-degenerate case
- Learning sums of powers of low-degree polynomials in the non-degenerate case
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
- On interpolating arithmetic read-once formulas with exponentiation
- On reconstruction and testing of read-once formulas
- On some computations on sparse polynomials
- On the relation between polynomial identity testing and finding variable disjoint factors
- Polynomial identity testing for depth 3 circuits
- Pseudorandom generators without the XOR lemma
- Queries and concept learning
- Random arithmetic formulas can be reconstructed efficiently
- Randomness efficient identity testing of multivariate polynomials
- Read-once polynomial identity testing
- Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits
- Reconstruction of depth-4 multilinear circuits with top fan-in 2
- Reconstruction of full rank algebraic branching programs
- Reconstruction of non-degenerate homogeneous depth three circuits
- Tensor rank is NP-complete
- Tensor reconstruction beyond constant rank
- The distribution of quadratic residues and non‐residues
This page was built for publication: Reconstruction of depth-4 multilinear circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907154)
