The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
A subexponential bound for linear programming
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Polynomial algorithms in linear programming
Khachiyan, L. G. (1980) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(80)90061-0 · Cited by 1,992
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
Megiddo, N. (1983) · SIAM Journal on Computing · doi:10.1137/0212052 · Cited by 837
Smallest enclosing disks (balls and ellipsoids)
Welzl, E. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0038202 · Cited by 791
Self-citationHOW GOOD IS THE SIMPLEX ALGORITHM
Klee, V. L., & Minty, G. J. (1970) · Cited by 769
Linear Programming in Linear Time When the Dimension Is Fixed
Megiddo, N. (1984) · Journal of the ACM · doi:10.1145/2422.322418 · Cited by 669
New applications of random sampling in computational geometry
Clarkson, K. L. (1987) · Discrete & Computational Geometry · doi:10.1007/bf02187879 · Cited by 317
Las Vegas algorithms for linear and integer programming when the dimension is small
Clarkson, K. L. (1995) · Journal of the ACM · doi:10.1145/201019.201036 · Cited by 223
Cited by
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Spielman, D. A., & Teng, S.-H. (2004) · Journal of the ACM · doi:10.1145/990308.990310 · Cited by 825
Efficient algorithms for geometric optimization
Agarwal, P. K., & Sharir, M. (1998) · ACM Computing Surveys · doi:10.1145/299917.299918 · Cited by 257
Self-citation
Metadata
- Authors
- Matoušek, J., Sharir, M., & Welzl, E.
- Venue
- Algorithmica
- Published
- 1996-10
- Volume
- 16
- Issue
- 4-5
- Pages
- 498-516
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W2152479402
- Cited by
- 300
- References
- 13
- FWCI
- 7.21
- 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: A subexponential bound for linear programming. https://app.cochat.ai/papers/10.1007/bf01940877
- The paper
- Matoušek, J., Sharir, M., & Welzl, E. (1996). A subexponential bound for linear programming. Algorithmica. https://doi.org/10.1007/bf01940877
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.
