Pages that link to "Item:Q2479314"

The following pages link to Characterizing Valiant's algebraic complexity classes (Q2479314):

Displaying 38 items.

• Binary determinantal complexity (Q286175) (← links)
• The arithmetic complexity of tensor contraction (Q290898) (← links)
• Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
• On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
• The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
• Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
• Fundamental invariants of orbit closures (Q517074) (← links)
• \(P\) versus \(NP\) and geometry (Q607059) (← links)
• \textsf{VNP} = \textsf{VP} in the multilinear world (Q894473) (← links)
• Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
• Balancing bounded treewidth circuits (Q1678757) (← links)
• Geometric complexity theory and matrix powering (Q1679673) (← links)
• Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
• Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
• Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
• Skew circuits of small width (Q2173307) (← links)
• Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
• Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
• Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
• Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
• Rectangular Kronecker coefficients and plethysms in geometric complexity theory (Q2404629) (← links)
• Dual VP classes (Q2410687) (← links)
• Improved bounds for reduction to depth 4 and depth 3 (Q2514141) (← links)
• Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
• Algebraic Complexity Classes (Q2821695) (← links)
• Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
• Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
• Permanent versus determinant: Not via saturations (Q2951164) (← links)
• Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844) (← links)
• Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes (Q3088284) (← links)
• Une dualité entre fonctions booléennes (Q3569370) (← links)
• Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing (Q4634059) (← links)
• No occurrence obstructions in geometric complexity theory (Q4961749) (← links)
• (Q5092471) (← links)
• (Q5111256) (← links)
• (Q5232538) (← links)
• Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
• On the closures of monotone algebraic classes and variants of the determinant (Q6582370) (← links)