549 search results - page 42 / 110 » On the Complexity of Restricted k-anonymity Problem |
COCOON
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
JCS
2008
14 years 9 months ago
2008
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
TIT
2011
14 years 4 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
AI
2008
Springer
14 years 10 months ago
2008
Springer
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...