4377 search results - page 117 / 876 » Mass problems and randomness |
166
click to vote
CORR
2011
Springer
15 years 18 days ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
152
Voted
CC
2008
Springer
15 years 5 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
152
click to vote
RSA
2006
15 years 5 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
148
click to vote
ICST
2010
IEEE
15 years 4 months ago
2010
IEEE
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...
158
Voted
PKC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We develop cryptographically secure techniques to guarantee unconditional privacy for respondents to polls. Our constructions are efficient and practical, and are shown ...