612 search results - page 2 / 123 » Hardness assumptions in the foundations of theoretical compu... |
SOFSEM
2005
Springer
15 years 3 months ago
2005
Springer
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
61
Voted
FOCS
2007
IEEE
15 years 1 months ago
2007
IEEE
ERSHOV
2001
Springer
15 years 2 months ago
2001
Springer
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...