scientific article; zbMATH DE number 1996521

zbMath1046.68057MaRDI QIDQ4432491

No author found.

Publication date: 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitygeometric invariant theoryrepresentation theorylower boundsalgebraic geometryhard nonexistence problemstractable existence problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Representation theory for linear algebraic groups (20G05) Geometric invariant theory (14L24) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Improved construction for universality of determinant and permanent ⋮ Tensor models, Kronecker coefficients and permutation centralizer algebras ⋮ Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals ⋮ A geometric approach to the Kronecker problem. I: The two row case. ⋮ On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients ⋮ Geometric complexity theory V: Efficient algorithms for Noether normalization ⋮ Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem

This page was built for publication: