Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,031,180 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Arithmetic circuit complexity
Computational complexity theory
Computing the permanent
Ketan Mulmuley
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Graph Convolutional Tracking
Junyu Gao
,
Tianzhu Zhang
,
Changsheng Xu
Computer Vision and Pattern Recognition
2019
Corpus ID: 196700924
Tracking by siamese networks has achieved favorable performance in recent years. However, most of existing siamese methods do not…
Expand
Highly Cited
2017
Highly Cited
2017
A data-driven multi-model methodology with deep feature selection for short-term wind forecasting
C. Feng
,
Mingjian Cui
,
B. Hodge
,
Jie Zhang
2017
Corpus ID: 40326200
Highly Cited
2016
Highly Cited
2016
No Occurrence Obstructions in Geometric Complexity Theory
Peter Bürgisser
,
Christian Ikenmeyer
,
G. Panova
IEEE Annual Symposium on Foundations of Computer…
2016
Corpus ID: 10008446
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the…
Expand
Highly Cited
2015
Highly Cited
2015
Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory
Christian Ikenmeyer
,
G. Panova
IEEE Annual Symposium on Foundations of Computer…
2015
Corpus ID: 6955356
The geometric complexity theory program is an approach to separate algebraic complexity classes, more precisely to show the…
Expand
2014
2014
Geometric complexity theory
Jeroen Zuiddam
2014
Corpus ID: 55361615
Geometric complexity theory provides a mathematical framework for attacking problems in complexity theory, by viewing them as…
Expand
2012
2012
Geometric Complexity Theory V: Efficient algorithms for Noether Normalization
K. Mulmuley
2012
Corpus ID: 14055162
We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether's…
Expand
Highly Cited
2004
Highly Cited
2004
Dynamic electrical switching of DNA layers on a metal surface
U. Rant
,
K. Arinaga
,
S. Fujita
,
N. Yokoyama
,
G. Abstreiter
,
M. Tornow
2004
Corpus ID: 55146218
We report on the dynamic control over the orientation of short oligonucleotide strands which are tethered to gold surfaces in…
Expand
Highly Cited
2000
Highly Cited
2000
Germ-cell tumors in childhood and adolescence
U. Göbel
,
D. Schneider
,
G. Calaminus
,
R. Haas
,
P. Schmidt
,
D. Harms
2000
Corpus ID: 21699275
Summary In mature and immature teratoma the treatment is surgical. The risk of recurrence can be estimated from the parameters…
Expand
Highly Cited
1998
Highly Cited
1998
Protein thermostability above 100°C: A key role for ionic interactions
C. Vetriani
,
D. Maeder
,
+6 authors
F. Robb
1998
Corpus ID: 8550026
The discovery of hyperthermophilic microorganisms and the analysis of hyperthermostable enzymes has established the fact that…
Expand
Highly Cited
1998
Highly Cited
1998
Anti-windup and bumpless-transfer schemes
C. Edwards
,
I. Postlethwaite
at - Automatisierungstechnik
1998
Corpus ID: 2368064
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE