The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Counting linear extensions
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
B., T. A. A. (1946) · The Mathematical Gazette · doi:10.1017/s0025557200071461 · Cited by 7,129
An introduction to the theory of numbers
(1960) · Journal of the Franklin Institute · doi:10.1016/0016-0032(60)90676-1 · Cited by 3,574
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
The Complexity of Enumeration and Reliability Problems
Valiant, L. G. (1979) · SIAM Journal on Computing · doi:10.1137/0208032 · Cited by 2,076
Approximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
An Algorithmic Theory of Numbers, Graphs and Convexity
Lovász, L. (1986) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970203 · Cited by 358
On the Complexity of Computing the Volume of a Polyhedron
Dyer, M. E., & Frieze, A. M. (1988) · SIAM Journal on Computing · doi:10.1137/0217060 · Cited by 307
On the computational power of PP and (+)P
Toda, S. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63527 · Cited by 235
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
Jerrum, M., & Sinclair, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62234 · Cited by 201
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
Lovasz, L., & Simonovits, M. (2002) · Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89553 · Cited by 190
How hard is it to marry at random? (On the approximation of the permanent)
Broder, A. Z. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12136 · Cited by 173
Counting linear extensions is #P-complete
Brightwell, G., & Winkler, P. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103441 · Cited by 163
Self-citationSampling and integration of near log-concave functions
Applegate, D., & Kannan, R. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103439 · Cited by 138
Hard Enumeration Problems in Geometry and Combinatorics
Linial, N. (1986) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0607036 · Cited by 130
A random polynomial time algorithm for approximating the volume of convex bodies
Dyer, M., & FRIEZE, A. M. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73043 · Cited by 124
Cited by
A Survey of Combinatorial Gray Codes
Savage, C. (1997) · SIAM Review · doi:10.1137/s0036144595295272 · Cited by 482
Fixed-Parameter Tractability and Completeness I: Basic Results
Downey, R. G., & Fellows, M. R. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792228228 · Cited by 468
Metadata
- Authors
- Brightwell, G., & Winkler, P.
- Venue
- Order
- Published
- 1991
- Volume
- 8
- Issue
- 3
- Pages
- 225-242
- ISSN
- 0167-8094 (ISSN-L)
- 1572-9273
- OpenAlex
- W1974745849
- Cited by
- 276
- References
- 15
- FWCI
- 1.89
- 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
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.