Keywords: NP‐complete
Close
Follow your search
Access your saved searches in your account

Would you like to receive an alert when new items match your search?
Close Modal
Sort by
Journal Articles
International Journal of Web Information Systems (2012) 8 (3): 322–344.
Published: 24 August 2012
... inference attack is mapped into a decision problem of searching a privacy inferring path with the maximal probability in the UICA graph and it is proved that it is a nondeterministic polynomial time (NP)‐complete problem by a two‐step reduction. A Privacy Leakage Detection Probability (PLD‐Probability...

or Create an Account

Close Modal
Close Modal