37 search results - page 3 / 8 » Some Sieving Algorithms for Lattice Problems |
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
COCO
2004
Springer
13 years 9 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
ISIM
2007
13 years 7 months ago
2007
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
ACISP
2010
Springer
13 years 7 months ago
2010
Springer
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . ...
SYRCODIS
2007
13 years 6 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...