4908 search results - page 86 / 982 » On the Complexity of Optimal K-Anonymity |
135
click to vote
CRYPTO
2007
Springer
16 years 13 days ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
143
click to vote
APL
1998
ACM
15 years 10 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
159
click to vote
ISSS
1997
IEEE
15 years 10 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
146
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
151
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...