A relation of primal-dual lattices and the complexity of shortest lattice vector problem

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.207, Iss.1, 1998-10, pp. : 105-116

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

New Complexity Analysis of the Primal–Dual Newton Method for Linear Optimization

By Peng J.

Annals of Operations Research, Vol. 99, Iss. 1-4, 2000-12 ,pp. : 23-39

Springer Publishing Company

Access to resources Recommend Favorite

A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties

By Du Donglei Lu Ruixing Xu Dachuan

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 191-200

Springer Publishing Company

Access to resources Recommend Favorite

Primal-Dual Monotone Kernel Regression

By Pelckmans K. Espinoza M. Brabanter J. Suykens J. Moor B.

Neural Processing Letters, Vol. 22, Iss. 2, 2005-10 ,pp. : 171-182

Springer Publishing Company

Access to resources Recommend Favorite

Primal–Dual Constraint Aggregation with Application to Stochastic Programming

By Davidson M.

Annals of Operations Research, Vol. 99, Iss. 1-4, 2000-12 ,pp. : 41-58

Springer Publishing Company

Access to resources Recommend Favorite

Primal–Dual Algorithms for Connected Facility Location Problems

By Swamy Chaitanya Kumar Amit

Algorithmica, Vol. 40, Iss. 4, 2004-09 ,pp. : 245-269

Springer Publishing Company

Access to resources Recommend Favorite