An introduction to geometric complexity theory
From MaRDI portal
(Redirected from Publication:737196)
Abstract: I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.
Recommendations
- Geometric complexity theory: an introduction for geometers
- A geometric approach to complexity
- Geometric complexity theory. I: An approach to the P vs. NP and related problems
- Geometry and complexity theory
- Complexity of some geometric and topological problems
- scientific article; zbMATH DE number 1996521
- scientific article; zbMATH DE number 4014033
- Geometric complexity theory and matrix powering
- On the complexity of some geometric problems in unbounded dimension
Cited in
(12)- On P vs. NP and geometric complexity theory: dedicated to Sri Ramakrishna
- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
- Geometry and complexity theory
- Geometric complexity theory: an introduction for geometers
- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
- scientific article; zbMATH DE number 1996521 (Why is no real title available?)
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- An overview of mathematical issues arising in the geometric complexity theory approach to \(\mathbf{VP}\neq\mathbf{VNP}\)
- Some fast algorithms multiplying a matrix by its adjoint
- Compatibility matrix method
- Geometric aspects of iterated matrix multiplication
- No occurrence obstructions in geometric complexity theory
This page was built for publication: An introduction to geometric complexity theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q737196)
