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

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

2009-08-13

arxiv.org/abs/0908.1932v2

Computer Science

Computational Complexity

65 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier 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 On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-701752