1380 search results - page 141 / 276 » A General Polynomial Sieve |
164
click to vote
FOCS
2005
IEEE
16 years 11 hour ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
159
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
154
click to vote
INDOCRYPT
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper, we propose a new variant of the NTRU public key cryptosystem − the MaTRU cryptosystem. MaTRU works under the same general principles as the NTRU cryptosy...
180
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
148
click to vote
SAS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...