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
University of Wisconsin - Madison. (Computer Sciences Department)
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0002-1600-5290
Microsoft Research Asia.
2010 (English)In: Algorithms and Computation - 21st International Symposium / [ed] Otfried Cheong and Kyung-Yong Chwa and Kunsoo Park, Springer , 2010, 253-265 p.Conference paper, Published paper (Refereed)
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 . We prove three complexity dichotomy theorems, leading to a general theorem for Holantc 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=(VE) over a set  of symmetric functions, we completely classify the complexity to be in P or #P-hard, according to , of:E01vVfv(E(v))where fv01 (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
Springer , 2010. 253-265 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6506
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-42822DOI: 10.1007/978-3-642-17517-6Scopus ID: 2-s2.0-78650905937ISBN: 978-3-642-17516-9 (print)OAI: oai:DiVA.org:kth-42822DiVA: diva2:447569
Conference
ISAAC 2010
Funder
EU, European Research Council, 6853
Note
QC 20111013Available from: 2011-10-13 Created: 2011-10-12 Last updated: 2011-10-13Bibliographically approved

Open Access in DiVA

fulltext(241 kB)45 downloads
File information
File name FULLTEXT01.pdfFile size 241 kBChecksum SHA-512
4cee1a09548072e375acbf79d94c9adfdafe37322af6bcde8cd2fd0b40da8b9504cb8ebfb6b9246fe034d0257d08eda2afde95427974ccce51c8a74bc2d17a41
Type fulltextMimetype application/pdf

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
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 45 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 65 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