The Query Complexity of Finding Local Minima in the Lattice

Author： Beimel A.   Geller F.   Kushilevitz E.  

Publisher： Academic Press

ISSN： 0890-5401

Source： Information and Computation, Vol.171, Iss.1, 2001-11, pp. : 69-83

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

The complexity of lattice knots

By Diao Y.   Ernst C.  

Topology and its Applications, Vol. 90, Iss. 1, 1998-12 ,pp. : 1-9

Elsevier

Access to resources Recommend Favorite

Convex Kernel Underestimation of Functions with Multiple Local Minima

By Mangasarian O.   Rosen J.   Thompson M.  

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 35-45

Springer Publishing Company

Access to resources Recommend Favorite

On the number of local minima for the multidimensional assignment problem

By Grundel Don   Krokhmal Pavlo   Oliveira Carlos   Pardalos Panos  

Journal of Combinatorial Optimization, Vol. 13, Iss. 1, 2007-01 ,pp. : 1-18

Springer Publishing Company

Access to resources Recommend Favorite

The local minima of the error surface of the 2-2-1 XOR network

By Sprinkhuizen-Kuyper I.G.   Boers E.J.W.  

Annals of Mathematics and Artificial Intelligence, Vol. 25, Iss. 1-2, 1999-01 ,pp. : 107-136

Springer Publishing Company

Access to resources Recommend Favorite

Local minima of lattices and vertices of Klein polyhedra

By Bykovskii V.  

Functional Analysis and Its Applications, Vol. 40, Iss. 1, 2006-01 ,pp. : 56-57

Springer Publishing Company

Access to resources Recommend Favorite