Geometric complexity theory

Known as: GCT 
Geometric complexity theory (GCT), is a research program in computational complexity theory proposed by Ketan Mulmuley and Milind Sohoni . The goal… (More)
Wikipedia

Related topics

Related topics

10 relations
Arithmetic circuit complexityComputational complexity theoryComputing the permanentKetan Mulmuley
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Geometric complexity theory and matrix powering
Valiant’s famous determinant versus permanent problem is the flagship problem in algebraic complexity theory. Mulmuley and Sohoni… (More)
Is this relevant?
2016
2016
No Occurrence Obstructions in Geometric Complexity Theory
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the… (More)
  • figure 1
  • figure 2
Is this relevant?
2016
2016
Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory
The geometric complexity theory program is an approach to separate algebraic complexity classes, more precisely to show the… (More)
Is this relevant?
2015
2015
An introduction to geometric complexity theory
The purpose of this article is to introduce mathematicians to uses of geometry in complexity theory. I focus on a central… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
Unifying Known Lower Bounds via Geometric Complexity Theory
We show that most algebraic circuit lower bounds and relations between lower bounds naturally fit into the representation… (More)
  • figure B.1
  • figure B.2
Is this relevant?
2013
2013
Explicit lower bounds via geometric complexity theory
We prove the lower bound R Mm) ≥ 3/2 m2-2 on the border rank of m x m matrix multiplication by exhibiting explicit representation… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
Prospects for Geometric Complexity Theory
It is a remarkable fact that two prominent problems of algebraic complexity theory, the permanent versus determinant problem and… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Geometric complexity theory and tensor rank
Mulmuley and Sohoni [GCT1, SICOMP 2001; GCT2, SICOMP 2008] proposed to view the permanent versus determinant problem as a… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Geometric Complexity Theory II: Towards explicit obstructions for embeddings among class varieties
In [26], henceforth referred to as Part I, we suggested an approach to the P vs. NP and related lower bound problems in… (More)
Is this relevant?
2007
2007
Geometric Complexity Theory: Introduction
Foreword These are lectures notes for the introductory graduate courses on geometric complexity theory (GCT) in the computer… (More)
  • figure 1
  • figure 1.1
  • figure 2.1
  • figure 4.1
  • figure 6.1
Is this relevant?