- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1420-8954
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
The complexity of the covering radius problem ; volume:14 ; number:2 ; pages:90-121 ; date:6.2005
Computational complexity ; 14, Heft 2, 90-121, 6.2005
- Creator
-
Guruswami, Venkatesan
Micciancio, Daniele
Regev, Oded
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-005-0193-y
- URN
-
urn:nbn:de:101:1-2021082720230023881203
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
2025-08-14T10:56:43+0200
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Guruswami, Venkatesan
- Micciancio, Daniele
- Regev, Oded
- SpringerLink (Online service)
Other Objects (12)
Gradual Covering Location Problem with Stochastic Radius
On the Complexity of Point Covering and Line Covering
Saturating systems and the rank-metric covering radius
The Covering Radius and a Discrete Surface Area for Non-Hollow Simplices
The Near Exact Bin Covering Problem
MIP Reformulations of the Probabilistic Set Covering Problem
Covering Convex Bodies and the Closest Vector Problem
On rectangular covering problems
The covering excess method in the theory of covering codes
A Short Note on the Probabilistic Set Covering Problem
The ordered gradual covering location problem on a network
The alpha particle charge radius, the radion and the proton radius puzzle
Gradual Covering Location Problem with Stochastic Radius
On the Complexity of Point Covering and Line Covering
Saturating systems and the rank-metric covering radius
The Covering Radius and a Discrete Surface Area for Non-Hollow Simplices
The Near Exact Bin Covering Problem
MIP Reformulations of the Probabilistic Set Covering Problem
Covering Convex Bodies and the Closest Vector Problem
On rectangular covering problems
The covering excess method in the theory of covering codes
A Short Note on the Probabilistic Set Covering Problem
The ordered gradual covering location problem on a network
The alpha particle charge radius, the radion and the proton radius puzzle
Gradual Covering Location Problem with Stochastic Radius
On the Complexity of Point Covering and Line Covering
Saturating systems and the rank-metric covering radius
The Covering Radius and a Discrete Surface Area for Non-Hollow Simplices
The Near Exact Bin Covering Problem
MIP Reformulations of the Probabilistic Set Covering Problem
Covering Convex Bodies and the Closest Vector Problem
On rectangular covering problems
The covering excess method in the theory of covering codes
A Short Note on the Probabilistic Set Covering Problem
The ordered gradual covering location problem on a network