The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Computational complexity of PERT problems
Abstract
Computational complexity results for two PERT problems are presented. A project is specified by precedence relations among tasks. Task durations are independent random variables with discrete, finite ranges. The following results are obtained: (1) computing a value of the cumulative distribution function of project duration is #P‐complete, (2) computing the mean of the distribution is at least as hard, and (3) neither of the problems in (1) and (2) can be computed in time polynomial in the number of points in the range of the project duration unless P = NP.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Resource-constrained project scheduling: Notation, classification, models, and methods
Brucker, P., Drexl, A., Möhring, R., Neumann, K., & Pesch, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00204-5 · Cited by 1,500
Statistical Timing Analysis: From Basic Principles to State of the Art
Blaauw, D., Chopra, K., Srivastava, A., & Scheffer, L. (2008) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2007.907047 · Cited by 370
A Robust Optimization Perspective on Stochastic Programming
Chen, X., Sim, M., & Sun, P. (2007) · Operations Research · doi:10.1287/opre.1070.0441 · Cited by 362
Metadata
- Authors
- Hagstrom, J. N.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1988-06
- Volume
- 18
- Issue
- 2
- Pages
- 139-147
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W1979365494
- Cited by
- 169
- References
- 1
- FWCI
- 1.25
- 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.