arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2309.04537math.CO
收藏

Greedoid Tutte多项式的复杂度

The complexity of the greedoid Tutte polynomial

Christopher Knapp, Steven Noble

AI总结:

研究有根图、有根有向图和二元矩阵三类greedoid的Tutte多项式在固定有理点求值的计算复杂度,证明除少数例外均为#P困难,并附证相关未发表结果。

摘要:

我们考虑三类greedoid的Tutte多项式:源自有根图、有根有向图和二元矩阵的greedoid。我们确定了在每个固定有理点(x,y)处求值这些多项式的计算复杂度。在每种情况下,我们证明求值是#P困难的,除了少数存在多项式时间算法的例外情况。在二元情况下,沿一条直线建立#P困难性依赖于Vertigan关于拟阵计数基的复杂度的未发表结果。为完整起见,我们包含一个附录提供该结果的证明。

英文摘要:

We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of evaluating each of these polynomials at each fixed rational point (x,y). In each case we show that evaluation is #P-hard except for a small number of exceptional cases when there is a polynomial time algorithm. In the binary case, establishing #P-hardness along one line relies on Vertigan's unpublished result on the complexity of counting bases of a matroid. For completeness, we include an appendix providing a proof if this result.

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

↑