A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6065024 / rank
 
Normal rank
Property / zbMATH Keywords
 
constraint satisfaction problem
Property / zbMATH Keywords: constraint satisfaction problem / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\#\)CSP
Property / zbMATH Keywords: \(\#\)CSP / rank
 
Normal rank
Property / zbMATH Keywords
 
bounded degree
Property / zbMATH Keywords: bounded degree / rank
 
Normal rank
Property / zbMATH Keywords
 
approximate counting
Property / zbMATH Keywords: approximate counting / rank
 
Normal rank
Property / zbMATH Keywords
 
dichotomy theorem
Property / zbMATH Keywords: dichotomy theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
T-constructibility
Property / zbMATH Keywords: T-constructibility / rank
 
Normal rank
Property / zbMATH Keywords
 
signature
Property / zbMATH Keywords: signature / rank
 
Normal rank
Property / zbMATH Keywords
 
holant problem
Property / zbMATH Keywords: holant problem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1550829276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Theory in Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms: from art to science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant problems and counting CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Counting Independent Sets in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Approximating Bounded-Degree Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Weighted Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation trichotomy for Boolean \#CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fanout limitations on constraint systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:51, 5 July 2024

scientific article
Language Label Description Also known as
English
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
scientific article

    Statements

    A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (English)
    0 references
    0 references
    13 August 2012
    0 references
    0 references
    constraint satisfaction problem
    0 references
    \(\#\)CSP
    0 references
    bounded degree
    0 references
    approximate counting
    0 references
    dichotomy theorem
    0 references
    T-constructibility
    0 references
    signature
    0 references
    holant problem
    0 references
    0 references