Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 16 Jul 2009 in cs.CC, math.AG, and math.RT | (0907.2850v2)

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.

Citations (112)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.