pith. sign in

arxiv: 0907.2850 · v2 · pith:2Q555K7Fnew · submitted 2009-07-16 · 💻 cs.CC · math.AG· math.RT

An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP

classification 💻 cs.CC math.AGmath.RT
keywords complexitygeometricprogramtheoryalgebraicanalogapproacharising
0
0 comments X
read the original abstract

We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant's algebraic analog of the P not equal to NP conjecture. We also describe the precise separation of complexity classes that their program proposes to demonstrate.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.