7106 search results - page 5 / 1422 » Restricted Complexity, General Complexity |
APWEB
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
STOC
1996
ACM
13 years 11 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...
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
ENC
2006
IEEE
14 years 1 months ago
2006
IEEE
