Sciweavers

551 search results - page 92 / 111
» Natural proofs
Sort
View
TCC
2009
Springer
142views Cryptology» more  TCC 2009»
14 years 9 months ago
Chosen-Ciphertext Security via Correlated Products
We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs ...
Alon Rosen, Gil Segev
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 9 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ICALP
2007
Springer
14 years 2 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 2 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ATAL
2004
Springer
14 years 2 months ago
Adaptive Information Infrastructures for the e-Society
Abstract. Positioned at the confluence between human/machine and hardware/software integration and backed by a solid proof of concept realized through several scenarios encompassin...
Mihaela Ulieru