No occurrence obstructions in geometric complexity theory
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12166
- Type
- D - Journal article
- DOI
-
10.1090/jams/908
- Title of journal
- JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY
- Article number
- -
- First page
- 163
- Volume
- 32
- Issue
- 1
- ISSN
- 0894-0347
- Open access status
- Compliant
- Month of publication
- October
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper was published at FOCS'16. In his book "Mathematics and Computation" (2019), Wigderson states that this paper shows "severe limitations to the original geometric complexity theory (GCT) approach (and perhaps [guides] it to more fruitful directions)." The paper also led to a revision of Aaronson's P vs NP survey article (2016) which already had to be updated after Ikenmeyer et al. (Advances in Mathematics, 2017).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -