7106 search results - page 5 / 1422 » Restricted Complexity, General Complexity |
100
Voted
APWEB
2008
Springer
15 years 4 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...
111
click to vote
STOC
1996
ACM
15 years 6 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...
199
Voted
IWPEC
2010
Springer
15 years 15 days 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...
123
Voted
SOFSEM
2010
Springer
15 years 11 months ago
2010
Springer
99
Voted
ENC
2006
IEEE
15 years 8 months ago
2006
IEEE
