Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,458

The DOI matches its Crossref record.

Improved methods for calculating vectors of short length in a lattice, including a complexity analysis

Open access
Fincke, U., Pohst, M.·1985·Mathematics of Computation

Abstract

The standard methods for calculating vectors of short length in a lattice use a reduction procedure followed by enumerating all vectors of Z m in a suitable box. However, it suffices to consider those x ∈ Z m which lie in a suitable ellipsoid having a much smaller volume than the box. We show in this paper that searching through that ellipsoid is in many cases much more efficient. If combined with an appropriate reduction procedure our method allows to do computations in lattices of much higher dimensions. Several randomly constructed numerical examples illustrate the superiority of our new method over the known ones.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1090/s0025-5718-1985-0777278-8

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 1,458

Metadata

Authors
Fincke, U., & Pohst, M.
Venue
Mathematics of Computation
Published
1985
Volume
44
Issue
170
Pages
463-471
ISSN
  • 0025-5718 (ISSN-L)
  • 1088-6842
OpenAlex
W1997002146
Cited by
1,458
References
0
FWCI
5.00
Type
journal article
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: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. https://app.cochat.ai/papers/10.1090/s0025-5718-1985-0777278-8
The paper
Fincke, U., & Pohst, M. (1985). Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1985-0777278-8

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.