gossip幺半群的NP-完全性
NP-completeness in the gossip monoid
摘要:
八卦幺半群形成了一个具有排他性的、短暂的连接的网络的代数模型,其中节点在形成连接时交换所有已知的信息。它们也自然地出现在纯粹数学中,作为由给定的有限集上的所有等价关系的集合在关系复合下生成的幺半群。我们证明了一些重要的判定问题,这些monoid(包括成员资格问题,因此,决定是否一个给定的知识状态可以出现在网络的考虑)是NP-完全的。这些结果不仅本身很有趣,而且还揭示了建立八卦幺半群基数的明显困难:这个问题在过去几年中引起了一些关注。
英文摘要:
Gossip monoids form an algebraic model of networks with exclusive, transient connections in which nodes, when they form a connection, exchange all known information. They also arise naturally in pure mathematics, as the monoids generated by the set of all equivalence relations on a given finite set under relational composition. We prove that a number of important decision problems for these monoids (including the membership problem, and hence the problem of deciding whether a given state of knowledge can arise in a network of the kind under consideration) are NP-complete. As well as being of interest in their own right, these results shed light on the apparent difficulty of establishing the cardinalities of the gossip monoids: a problem which has attracted some attention in the last few years.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。