✦ LIBER ✦

Dual vectors and lower bounds for the nearest lattice point problem

✍ Scribed by J. Hastad

Publisher: Springer-Verlag
Year: 1988
Tongue: English
Weight: 318 KB
Volume: 8
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02122554

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tighter Lower Bounds for Nearest Neighbo

Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model

✍ Omer Barkol; Yuval Rabani 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

We prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds are for randomized, two-sided error, algorithms in Yao's cell probe model. Our bounds are in the form of a tradeoff among the number of cells, the size of a cell, and the search time. For example, suppose we

A relation of primal-dual lattices and t

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

✍ Jin-Yi Cai 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 891 KB

A Dual Framework for Lower Bounds of the

A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization

✍ S. E. Karisch; E. Çela; J. Clausen; T. Espersen 📂 Article 📅 1999 🏛 Springer Vienna 🌐 English ⚖ 300 KB

Upper and lower bounds for the partition

Upper and lower bounds for the partition function of lattice models

✍ Michael Heise 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 679 KB

Lower bounds and reduction procedures fo

Lower bounds and reduction procedures for the bin packing problem

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 731 KB

New lower bounds for the Capacitated Arc

New lower bounds for the Capacitated Arc Routing Problem

✍ Wen Lea Pearn 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB