The Tutte polynomial modulo a prime

被引：0
|
作者：
Goodall, AJ [1 ]
机构：
[1] Math Inst, Oxford OX1 3LB, England
来源：
ADVANCES IN APPLIED MATHEMATICS | 2004年 / 32卷 / 1-2期
基金：
英国工程与自然科学研究理事会;
关键词：
D O I：
10.1016/S0196-8858(03)00084-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
For F-p the field on prime number p > 3 elements, it has been conjectured that there are just p + 3 evaluations of the Tutte polynomial in F-p which are computable in polynomial time. In this note it is shown that if p not equivalent to -1 mod 12 then there are further polynomial-time computable evaluations. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码：293 / 298
页数：6
相关论文
共 50 条
12345