Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Tracking by siamese networks has achieved favorable performance in recent years. However, most of existing siamese methods do not… 
Highly Cited
2016
Highly Cited
2016
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the… 
Highly Cited
2015
Highly Cited
2015
The geometric complexity theory program is an approach to separate algebraic complexity classes, more precisely to show the… 
2014
2014
Geometric complexity theory provides a mathematical framework for attacking problems in complexity theory, by viewing them as… 
2012
2012
We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether's… 
Highly Cited
2004
Highly Cited
2004
We report on the dynamic control over the orientation of short oligonucleotide strands which are tethered to gold surfaces in… 
Highly Cited
2000
Highly Cited
2000
Summary In mature and immature teratoma the treatment is surgical. The risk of recurrence can be estimated from the parameters… 
Highly Cited
1998
Highly Cited
1998
The discovery of hyperthermophilic microorganisms and the analysis of hyperthermostable enzymes has established the fact that… 
Highly Cited
1998
Highly Cited
1998