Pages that link to "Item:Q3016252"
From MaRDI portal
The following pages link to On P vs. NP and geometric complexity theory (Q3016252):
Displaying 17 items.
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient (Q438742) (← links)
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials (Q1686837) (← links)
- On vanishing of Kronecker coefficients (Q1686840) (← links)
- Complexity classes and completeness in algebraic geometry (Q1740570) (← links)
- Obstructions to combinatorial formulas for plethysm (Q1753006) (← links)
- Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals (Q2219301) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- No occurrence obstructions in geometric complexity theory (Q4961749) (← links)
- On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
- Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem (Q5248116) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- Algebraic independence in positive characteristic: A $p$-adic calculus (Q5420121) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
- Estimating and computing Kronecker coefficients: a vector partition function approach (Q6644893) (← links)
