3946 search results - page 161 / 790 » The computational complexity of choice sets |
189
click to vote
FCS
2009
15 years 4 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
160
click to vote
ASIACRYPT
1991
Springer
15 years 10 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...
212
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
136
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
181
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...