scientific article; zbMATH DE number 1996521
From MaRDI portal
Publication:4432491
computational complexitylower boundsalgebraic geometryrepresentation theorygeometric invariant theoryhard nonexistence problemstractable existence problems
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Geometric invariant theory (14L24) Representation theory for linear algebraic groups (20G05) Complexity of computation (including implicit computational complexity) (03D15)
Recommendations
- Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
- Geometric complexity theory. I: An approach to the P vs. NP and related problems
- An overview of mathematical issues arising in the geometric complexity theory approach to \(\mathbf{VP}\neq\mathbf{VNP}\)
- Geometric complexity theory: an introduction for geometers
- An introduction to geometric complexity theory
Cited in
(16)- Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
- Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals
- Tensor models, Kronecker coefficients and permutation centralizer algebras
- Improved construction for universality of determinant and permanent
- A geometric approach to the Kronecker problem. I: The two row case.
- An introduction to geometric complexity theory
- \(P\) versus \(NP\) and geometry
- Unifying known lower bounds via geometric complexity theory
- Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem
- NP-Hardness of Computing PL Geometric Category in Dimension 2
- An overview of mathematical issues arising in the geometric complexity theory approach to \(\mathbf{VP}\neq\mathbf{VNP}\)
- Geometric complexity theory. V: Efficient algorithms for Noether normalization
- No occurrence obstructions in geometric complexity theory
- scientific article; zbMATH DE number 5971212 (Why is no real title available?)
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- Geometric complexity theory. I: An approach to the P vs. NP and related problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4432491)
