 Our analysis of the oracle complexity is based on a potential function that captures simultaneously the size of the search set and the density of the lattice . To achieve the O(n^2) term in the oracle complexity, technical ingredients from convex geometry are applied .
<coherence>  Our analysis of the oracle complexity is based on a potential function that captures simultaneously the size of the search set and the density of the lattice . To achieve the O(n^2) term in the oracle complexity, technical ingredients from convex geometry are applied .
 Our analysis of the oracle complexity is based on a potential function that captures simultaneously the size of the search set and the density of the lattice , which we analyze via technical tools from convex geometry are applied .