1450 search results - page 84 / 290 » On the Complexity of Hardness Amplification |
ASIACRYPT
2009
Springer
14 years 3 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
ICCV
2003
IEEE
14 years 2 months ago
2003
IEEE
The perception of transparent objects from images is known to be a very hard problem in vision. Given a single image, it is difficult to even detect the presence of transparent o...
CJTCS
1999
13 years 8 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
IS
2012
12 years 4 months ago
2012
When transforming data one often wants certain information in the data source to be preserved, i.e., we identify parts of the source data and require these parts to be transformed...
POPL
2012
ACM
12 years 4 months ago
2012
ACM
Data races are among the most reliable indicators of programming errors in concurrent software. For at least two decades, Lamport’s happens-before (HB) relation has served as th...