3208 search results - page 576 / 642 » A Lower Bound for Primality |
158
click to vote
FOCS
2009
IEEE
16 years 18 days ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
179
click to vote
ASIACRYPT
2009
Springer
16 years 13 days ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
178
click to vote
COCO
2009
Springer
16 years 13 days ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
174
click to vote
FOCS
2008
IEEE
16 years 9 days ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
167
click to vote
FOCS
2007
IEEE
16 years 5 days ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...