Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem

Combinatorica - Germany
doi 10.1007/bf02122554
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

New Lower Bounds for Hopcroft's Problem

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1996English

Minimax Lower Bounds for the Two-Armed Bandit Problem

SSRN Electronic Journal
1997English

Lower Bounds on Lattice Enumeration With Extreme Pruning

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Tabu Search and Lower Bounds for a Combined Production–transportation Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2013English

Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

An Augmented Lagrangian Dual Approach for the H-Weighted Nearest Correlation Matrix Problem

IMA Journal of Numerical Analysis
Computational MathematicsApplied MathematicsMathematics
2010English

The Lattice Point Problem of Many-Dimensional Hyperboloids I

Acta Arithmetica
Number TheoryAlgebra
1963English

Polymers With Nearest- And Next Nearest-Neighbor Interactions on the Husimi Lattice

Journal of Physics A: Mathematical and Theoretical
StatisticsProbabilityNonlinear PhysicsSimulationMathematical PhysicsStatisticalModelingAstronomyPhysics
2016English

On Lower Bounds for the Ihara Constants and

Compositio Mathematica
Number TheoryAlgebra
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy