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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
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

Latest revision as of 12: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
    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

    Identifiers