Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324796 / 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: The complexity of weighted Boolean \#CSP with mixed signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Dichotomies for Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A collapse theorem for holographic algorithms with matchgates on domain size at most 4 / 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: The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms: the power of dimensionality resolved / 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: Signature theory in holographic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Holant Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms by Fibonacci gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for Holant Problems with a Function on Domain Size 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of complex weighted Boolean \#CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / 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 Effective Dichotomy for the Counting Constraint Satisfaction Problem / 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: Q3113689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of planar Boolean \#CSP with complex weights / 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: Q4002797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy for real weighted 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: Polynomial-Time Approximation Algorithms for the Ising Model / 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: Holographic algorithms without matchgates / 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: Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / 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 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: Quantum Circuits That Can Be Simulated Classically in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness of matchgates. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/17m1131672 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2985956690 / rank
 
Normal rank

Latest revision as of 09:26, 30 July 2024

scientific article; zbMATH DE number 7516618
Language Label Description Also known as
English
Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
scientific article; zbMATH DE number 7516618

    Statements

    Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (English)
    0 references
    0 references
    0 references
    3 May 2022
    0 references
    \#CSP
    0 references
    holographic algorithms
    0 references
    matchgates
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers