scientific article; zbMATH DE number 1996521
From MaRDI portal
Publication:4432491
algebraic geometrycomputational complexitygeometric invariant theoryhard nonexistence problemslower boundsrepresentation theorytractable existence problems
Complexity of computation (including implicit computational complexity) (03D15) Geometric invariant theory (14L24) Representation theory for linear algebraic groups (20G05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
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)- Tensor models, Kronecker coefficients and permutation centralizer algebras
- Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals
- Unifying known lower bounds via geometric complexity theory
- 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
- Geometric complexity theory. V: Efficient algorithms for Noether normalization
- An overview of mathematical issues arising in the geometric complexity theory approach to \(\mathbf{VP}\neq\mathbf{VNP}\)
- scientific article; zbMATH DE number 5971212 (Why is no real title available?)
- Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
- No occurrence obstructions in geometric complexity theory
- Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem
- \(P\) versus \(NP\) and geometry
- NP-Hardness of Computing PL Geometric Category in Dimension 2
- An introduction to geometric complexity theory
- Improved construction for universality of determinant and permanent
- A geometric approach to the Kronecker problem. I: The two row case.
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)
