The Complexity of Partition Functions on Hermitian Matrices
The Complexity of Partition Functions on Hermitian Matrices
复制标题
Hermitian 矩阵上配分函数的复杂性
DOI:
--
复制
发表时间:
2010
期刊:
影响因子:
--
通讯作者:
M. Thurley
中科院分区:
文献类型:
--
作者:
M. Thurley
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants, for example, the number of independent sets of a graph or the number nowhere zero k-flows. Contributing to recent developments on the complexity of partition functions we study the complexity of partition functions with complex values. These functions are usually determined by a square matrix A and it was shown by Goldberg, Grohe, Jerrum, and Thurley that for each real-valued symmetric matrix, the corresponding partition function is either polynomial time computable or #P-hard. Extending this result, we give a complete description of the complexity of partition functions definable by Hermitian matrices. These can also be classified into polynomial time computable and #P-hard ones. Although the criterion for polynomial time computability is not describable in a single line, we give a clear account of it in terms of structures associated with Abelian groups.
登录
查看更多内容
DOI:
10.1145/1806689.1806789
发表时间:
2010-03
期刊:
--
影响因子:
--
作者:
M. Dyer;David Richerby
通讯作者:
M. Dyer;David Richerby
影响因子:
1.4
作者:
Cai, Jin-Yi;Chen, Xi.
通讯作者:
Chen, Xi.
DOI:
10.1137/070690201
发表时间:
2007-04
期刊:
SIAM J. Comput.
影响因子:
--
作者:
M. Dyer;L. A. Goldberg;M. Jerrum
通讯作者:
M. Dyer;L. A. Goldberg;M. Jerrum
影响因子:
1.6
作者:
Goldberg L
通讯作者:
Goldberg L
影响因子:
1
作者:
Dyer M
通讯作者:
Dyer M