Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1008.0683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Counting Constraint Satisfaction Problem / 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: Graph Homomorphisms with Complex Values: A Dichotomy Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Matchgates and Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valiant's holant theorem and matchgate tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete dichotomy rises from the capture of vanishing signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basis collapse in holographic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On symmetric signatures in holographic algorithms / 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: Holant problems and counting CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Geometry / 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: Q4521549 / 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: The Complexity of Symmetric Boolean Parity Holant Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beitrag zur Theorie des Ferromagnetismus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics, three-dimensionality and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of dimers on a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / 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: Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimer problem in statistical mechanics-an exact result / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness of matchgates. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Circuits That Can Be Simulated Classically in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of counting problems on 3-regular planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spontaneous Magnetization of a Two-Dimensional Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation / rank
 
Normal rank

Latest revision as of 21:19, 13 July 2024

scientific article; zbMATH DE number 6724225
Language Label Description Also known as
English
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
scientific article; zbMATH DE number 6724225

    Statements

    Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (English)
    0 references
    0 references
    0 references
    0 references
    30 May 2017
    0 references
    holographic algorithms
    0 references
    counting problems
    0 references
    \#P
    0 references
    dichotomy theorems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references