The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Counting linear extensions is #P-complete
Open accessAbstract
We show that the problem of counting the number of linear extensions of a given partially ordered set is #P-complete.This settles a long-standing open question and contrssts with recent results giving randomized polynomial-time algorit hms for estimating the number of linear extensions.One consequence is that computing the volume of a rational polyhedron is strongly #P-hard.We also show that the closely related problems of determining the average height of an element c of a given poset, and of determining the probability that z lies below y in a random linear extension, are #P-complete.
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 computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Cited by
Bayesian Artificial Intelligence
Korb, K. B., & Nicholson, A. E. (2003) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203491294 · Cited by 1,014
Rumors in a Network: Who's the Culprit?
Shah, D., & Zaman, T. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158885 · Cited by 691
A Survey of Combinatorial Gray Codes
Savage, C. (1997) · SIAM Review · doi:10.1137/s0036144595295272 · Cited by 482
Random walks in a convex body and an improved volume algorithm
Lovász, L., & Simonovits, M. (1993) · Random Structures & Algorithms · doi:10.1002/rsa.3240040402 · Cited by 409
Brightwell, G., & Winkler, P. (1991) · Order · doi:10.1007/bf00383444 · Cited by 276
Self-citation
Metadata
- Authors
- Brightwell, G., & Winkler, P.
- Venue
- Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91
- Publisher
- ACM Press
- Published
- 1991
- Pages
- 175-181
- OpenAlex
- W2075164088
- Cited by
- 163
- References
- 1
- FWCI
- 5.03
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Counting linear extensions is #P-complete. https://app.cochat.ai/papers/10.1145/103418.103441
- The paper
- Brightwell, G., & Winkler, P. (1991). Counting linear extensions is #P-complete. Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91. https://doi.org/10.1145/103418.103441
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.