Corpus ID: 14099339

On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier

@article{Mulmuley2009OnPV,
  title={On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier},
  author={Ketan Mulmuley},
  journal={ArXiv},
  year={2009},
  volume={abs/0908.1932}
}
  • Ketan Mulmuley
  • Published 2009
  • Computer Science, Mathematics
  • ArXiv
  • Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory. 

    Figures and Topics from this paper.

    Paper Mentions

    Citations

    Publications citing this paper.

    Partial Derivatives in Arithmetic Complexity and Beyond

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 95 REFERENCES

    The Complexity of Computing the Permanent

    VIEW 3 EXCERPTS