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.
- Lower bounds for depth-three arithmetic circuits with small bottom fanin (Q301527) (← links)
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Factors of low individual degree polynomials (Q301529) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- \textsf{VNP} = \textsf{VP} in the multilinear world (Q894473) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- Ulrich complexity (Q1679674) (← links)
- Sums of read-once formulas: how many summands are necessary? (Q1686070) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials (Q1686837) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← links)
- Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
- On the complexity of noncommutative polynomial factorization (Q1784944) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- On measures of space over real and complex numbers (Q2019497) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
- Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) (Q2054204) (← links)
- A lower bound on determinantal complexity (Q2087768) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- Almost all subgeneric third-order Chow decompositions are identifiable (Q2088044) (← links)
- Variants of the determinant polynomial and the \textsf{VP}-completeness (Q2117074) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- Partial strong structural controllability (Q2139435) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\) (Q2174943) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
- Learning algebraic decompositions using Prony structures (Q2182612) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree (Q2294435) (← links)
- On hard instances of non-commutative permanent (Q2306589) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- A quadratic lower bound for homogeneous algebraic branching programs (Q2323359) (← links)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
- Lower bounds for the circuit size of partially homogeneous polynomials (Q2405138) (← links)
- Improved bounds for reduction to depth 4 and depth 3 (Q2514141) (← links)
- Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
