Untitled

Geometric complexity theory is an approach towards proving lower bounds in algebraic complexity theory via methods from algebraic geometry and representation theory.It was introduced by Mulmuley and Sohoni and has gained significant momentum over the last few years.Since deep methods from several different areas of mathematics are involved, geometric complexity theory has a steep learning curve.There are great survey articles on geometric complexity theory, but those require a significant level of mathematical background or often only sketch many of the proofs, see, e.

Authors

Publication Details

Journal
Theory of Computing
Published
2025-01-01
DOI
https://doi.org/10.4086/toc.gs.2025.010
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Untitled

Markus Blaeser, Christian Ikenmeyer
Theory of Computing
Polynomial and algebraic computation
article

Untitled

Markus Blaeser, Christian Ikenmeyer
article en

Abstract

Geometric complexity theory is an approach towards proving lower bounds in algebraic complexity theory via methods from algebraic geometry and representation theory.It was introduced by Mulmuley and Sohoni and has gained significant momentum over the last few years.Since deep methods from several different areas of mathematics are involved, geometric complexity theory has a steep learning curve.There are great survey articles on geometric complexity theory, but those require a significant level of mathematical background or often only sketch many of the proofs, see, e.

Theory of ComputingVol. 1(1)
Openalex Percentile: Top 87%
Polynomial and algebraic computation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Untitled — Markus Blaeser, Christian Ikenmeyer · Theory of Computing (2025) | TGRS Research Map | TGRS