Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
From Holant to #CSP and Back: Dichotomy for Holant (c) Problems
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0002-1600-5290
2012 (English)In: Algorithmica, ISSN 0178-4617, E-ISSN 1432-0541, Vol. 64, no 3, 511-533 p.Article in journal (Refereed) Published
Abstract [en]

We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-colorings. We consider these problems for general complex valued functions that take boolean inputs. We show that results from one framework can be used to derive results in another, and this happens in both directions. Holographic reductions discover an underlying unity, which is only revealed when these counting problems are investigated in the complex domain a",. We prove three complexity dichotomy theorems, leading to a general theorem for Holant (c) problems. This is the natural class of Holant problems where one can assign constants 0 or 1. More specifically, given any signature grid on G=(V,E) over a set of symmetric functions, we completely classify the complexity to be in P or #P-hard, according to F , of Sigma Pi f(v)(sigma vertical bar E(v)), sigma:E ->{0,1}v epsilon V where f(v) epsilon F boolean OR {0, 1} (0, 1 are the unary constant 0, 1 functions). Not only is holographic reduction the main tool, but also the final dichotomy can be only naturally stated in the language of holographic transformations. The proof goes through another dichotomy theorem on Boolean complex weighted #CSP.

Place, publisher, year, edition, pages
2012. Vol. 64, no 3, 511-533 p.
Keyword [en]
Holant problem, #CSP, Holographic reduction, Dichotomy
National Category
Computer Science Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-103121DOI: 10.1007/s00453-012-9626-6ISI: 000308228400009Scopus ID: 2-s2.0-84867229589OAI: oai:DiVA.org:kth-103121DiVA: diva2:558710
Note

QC 20121004

Available from: 2012-10-04 Created: 2012-10-04 Last updated: 2017-12-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Huang, Sangxia

Search in DiVA

By author/editor
Huang, Sangxia
By organisation
Theoretical Computer Science, TCS
In the same journal
Algorithmica
Computer ScienceMathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 69 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf