MST
2010
12 years 11 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
CORR
2000
Springer
13 years 4 months ago
2000
Springer
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or t...
ASIACRYPT
1991
Springer
13 years 8 months ago
1991
Springer
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
FSTTCS
1994
Springer
13 years 8 months ago
1994
Springer
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...