549 search results - page 24 / 110 » On the Complexity of Restricted k-anonymity Problem |
STACS
2001
Springer
15 years 2 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
PRICAI
2000
Springer
15 years 1 months ago
2000
Springer
The automated prediction of a user's interests and requirements is an area of interest to the Artificial Intelligence community. However, current predictive statistical approa...
JAPLL
2010
14 years 8 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
LATINCRYPT
2010
14 years 8 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
ISAAC
2007
Springer
15 years 4 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...