On the NP-Completeness of Computing the Commonality Amongst the Objects upon which a Collection of Agents has Performed an Action
DOI:
https://doi.org/10.13053/cys-17-4-1451Keywords:
Social Group Commonality, complexity theory, LCS, HS, graphs.Abstract
We prove the NP-completeness of a problem, we call Social Group Commonality (SGC), which queries the commonality amongst the objects ‘touched’ by a collections of agents while executing an action. Although it naturally arises in several contexts, e.g., to profile the behaviour of a collection of system users, SGC has, to the authors’ knowledge, been ignored. Our proof of SGC NP-completeness consists of a Karp reduction, from the well-known Longest Common Subsequence (LCS) problem to SGC. We also prove that a special case of SGC, we call 2-SGC, where the commonality amongst actions is limited to agent pairs, remains NP- complete. For proving NP-completeness of 2-SGC, though, our reduction departs from the well-known Hitting Set problem. Before concluding the paper, we hypothesise that the optimality version of SGC is NP-hard, hinting on how to deal with the proof obligation.Downloads
Published
2013-12-30
Issue
Section
Articles
License
Hereby I transfer exclusively to the Journal "Computación y Sistemas", published by the Computing Research Center (CIC-IPN),the Copyright of the aforementioned paper. I also accept that these
rights will not be transferred to any other publication, in any other format, language or other existing means of developing.I certify that the paper has not been previously disclosed or simultaneously submitted to any other publication, and that it does not contain material whose publication would violate the Copyright or other proprietary rights of any person, company or institution. I certify that I have the permission from the institution or company where I work or study to publish this work.The representative author accepts the responsibility for the publicationof this paper on behalf of each and every one of the authors.
This transfer is subject to the following conditions:- The authors retain all ownership rights (such as patent rights) of this work, except for the publishing rights transferred to the CIC, through this document.
- Authors retain the right to publish the work in whole or in part in any book they are the authors or publishers. They can also make use of this work in conferences, courses, personal web pages, and so on.
- Authors may include working as part of his thesis, for non-profit distribution only.