You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Oxford » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Oxford

Return to search Previous output Next output

Output 3 of 263 in the submission

Article title

A Complexity Dichotomy for Partition Functions with Mixed Signs

Type

D - Journal article

DOI

10.1137/090757496

Title of journal

SIAM Journal on Computing

Article number

Volume number

Issue number

First page of article

3336

ISSN of journal

0097-5397

Year of publication

2010

URL

http://epubs.siam.org/doi/abs/10.1137/090757496

Number of additional authors

Additional information

<10>

This paper contributed significantly to progress in dichotomy theorems. The paper "Graph Homomorphisms with Complex Values: A Dichotomy Theorem" (Cai, Chen, Lu, SICOMP 2013) refers to the paper as "comprising 73 pages of beautiful proofs of both exceptional depth and conceptual vision". This comment is also made in Chen's SIGACT News column (Dec 2011) which explains the technical significance and context of the paper. See also Cai's Jan 2012 column on Lipton's blog which describes the paper as "beautiful" and a "major step" and explains how it contributed to their final resolution of the complex case.

Interdisciplinary

Cross-referral requested

Research group

None

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract