Pages that link to "Item:Q3069052"
From MaRDI portal
The following pages link to Arithmetic Circuits: A survey of recent results and open questions (Q3069052):
Displaying 50 items.
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- On Hard Instances of Non-Commutative Permanent (Q2817859) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Characterizing Arithmetic Read-Once Formulae (Q2828215) (← links)
- Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
- Types of depth and formula size (Q2920906) (← links)
- Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- Algebraic Independence and Blackbox Identity Testing (Q3012915) (← links)
- Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization (Q3295273) (← links)
- Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. (Q3304115) (← links)
- The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In (Q3451754) (← links)
- Most secant varieties of tangential varieties to Veronese varieties are nondefective (Q4588219) (← links)
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← 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)
- Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (Q4638110) (← links)
- Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (Q4646460) (← links)
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models (Q4988917) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- (Q5002654) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- (Q5002729) (← links)
- (Q5028363) (← links)
- (Q5089246) (← links)
- Towards Optimal Depth Reductions for Syntactically Multilinear Circuits (Q5091237) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- A generalized sylvester-gallai type theorem for quadratic polynomials (Q5092455) (← links)
- (Q5092460) (← links)
- (Q5092463) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5092480) (← links)
- (Q5092488) (← links)
- Emptiness Problems for Integer Circuits (Q5111247) (← links)
- (Q5111252) (← links)
- (Q5111256) (← links)
- (Q5121898) (← links)
- (Q5121899) (← links)
- (Q5121900) (← links)
- (Q5121901) (← links)
- Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
- (Q5140843) (← links)
- (Q5232538) (← links)
- Short Proofs for the Determinant Identities (Q5252690) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)