arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1408.6509math.GRcs.CC
收藏

群积中的背包问题

Knapsack problems in products of groups

Elizaveta Frenkel, Andrey Nikolaev, Alexander Ushakov

摘要:

经典的背包问题和相关问题可以自然地推广到任意(非交换)群,统称为背包型群问题。我们研究了自由积和直积对其时间复杂度的影响。我们证明了自由积在一定意义下保持背包型问题的时间复杂性,而直积可能放大背包型问题的时间复杂性.我们的方法可以得到有限子群上合并自由积的有理子集成员问题的复杂性结果.

英文摘要:

The classic knapsack and related problems have natural generalizations to arbitrary (non-commutative) groups, collectively called knapsack-type problems in groups. We study the effect of free and direct products on their time complexity. We show that free products in certain sense preserve time complexity of knapsack-type problems, while direct products may amplify it. Our methods allow to obtain complexity results for rational subset membership problem in amalgamated free products over finite subgroups.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑