The Shortest Vector in a Lattice Is Hard to Approximate to Within Some Constant

SIAM Journal on Computing- United States

doi 10.1137/s0097539700373039

Full Text

Abstract

Available in

Date

Authors

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

How to Calculate Shortest Vectors in a Lattice

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1975English

Asymmetric K-Center Is Log* N-Hard to Approximate

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2005English

What to Compensate? Some Surprisingly Unappreciated Reasons Why the Problem Is So Hard

SSRN Electronic Journal
2003English

A Polynomial-Time Algorithm to Approximate the Mixed Volume Within a Simply Exponential Factor

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2009English

When Is a Network Epidemic Hard to Eliminate?

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2017English

A Three-Level Sieve Algorithm for the Shortest Vector Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Compatible Seminorms in a Vector Lattice

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1956English

Sometimes Treatment Is Hard to Swallow

Caring for the Ages
2016English

Why the Common Rule Is Hard to Amend

Indiana Health Law Review
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy