The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Geometric Complexity Theory I: An Approach to the P vs.NP and Related Problems
Abstract
We suggest an approach based on geometric invariant theory to the fundamental lower bound problems in complexity theory concerning formula and circuit size. Specifically, we introduce the notion of a partially stable point in a reductive-group representation, which generalizes the notion of stability in geometric invariant theory due to Mumford [Geometric Invariant Theory, Springer-Verlag, Berlin, 1965]. Then we reduce fundamental lower bound problems in complexity theory to problems concerning infinitesimal neighborhoods of the orbits of partially stable points. We also suggest an approach to tackle the latter class of problems via construction of explicit obstructions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Humphreys, J. E. (1975) · Graduate texts in mathematics · doi:10.1007/978-1-4684-9443-3 · Cited by 2,138
Borel, A. (1991) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0941-6 · Cited by 1,660
Introduction to Toric Varieties. (AM-131)
Fulton, W. (1993) · Princeton University Press eBooks · doi:10.1515/9781400882526 · Cited by 1,402
Cited by
Arithmetic Circuits: A Survey of Recent Results and Open Questions
Shpilka, A., & Yehudayoff, A. (2010) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000039 · Cited by 363
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
The status of the P versus NP problem
Fortnow, L. (2009) · Communications of the ACM · doi:10.1145/1562164.1562186 · Cited by 321
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
Williams, R. (2013) · SIAM Journal on Computing · doi:10.1137/10080703x · Cited by 157
Metadata
- Authors
- Mulmuley, K. D., & Sohoni, M.
- Venue
- SIAM Journal on Computing
- Published
- 2001-01
- Volume
- 31
- Issue
- 2
- Pages
- 496-526
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2074207216
- Cited by
- 196
- References
- 5
- FWCI
- 1.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Geometric Complexity Theory I: An Approach to the P vs.NP and Related Problems. https://app.cochat.ai/papers/10.1137/s009753970038715x
- The paper
- Mulmuley, K. D., & Sohoni, M. (2001). Geometric Complexity Theory I: An Approach to the P vs.NP and Related Problems. SIAM Journal on Computing. https://doi.org/10.1137/s009753970038715x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.