Computer Science – Computational Complexity
Scientific paper
2009-07-16
Computer Science
Computational Complexity
29 pages, v2: role of symmetric Kronecker coefficients explained
Scientific paper
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.
Buergisser Peter
Landsberg Joseph M.
Manivel Laurent
Weyman Jerzy
No associations
LandOfFree
An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-621956