From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313): 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.1007/s00453-012-9626-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1660495057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a dichotomy theorem for the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partition functions / 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: A computational proof of complexity of some restricted counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Weighted Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Counting Homomorphisms to Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting homomorphisms to directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum: The complexity of counting graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflection positivity, rank connectivity, and homomorphism of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Dichotomy for Partition Functions with Mixed Signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of a Class of Counting Problems Using Holographic Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant Problems for Regular Graphs with Complex Edge Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of counting problems on 3-regular planar graphs / rank
 
Normal rank

Latest revision as of 04:05, 6 July 2024

scientific article
Language Label Description Also known as
English
From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
scientific article

    Statements

    From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 January 2013
    0 references
    0 references
    Holant problem
    0 references
    \#CSP
    0 references
    holographic reduction
    0 references
    dichotomy
    0 references
    0 references