Another NP-complete problem and the complexity of computing short vectors in a lattice

Boas, P. v. E. (1981). Another NP-complete problem and the complexity of computing short vectors in a lattice.

Type

Unclassified

Intellectual base

Unclassified

Year

1981

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Lattice problem
  • … between constitutive identity and a convenient observable transfers from A canonical example satisfies the full defining rule of Lattice problem with assumptions and conventions explicit. to A careful use of Lattice problem tests the constitutive rule and nearest confusable rather than relying on the label alone..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:d70965b970db · see in the full table