The complexity of counting planar graph homomorphisms of domain size 3 (Q6499302): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q130994387, #quickstatements; #temporary_batch_1733741289228
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Quantum and non-signalling graph isomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Holant Dichotomy Inspired by Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automorphism groups of homogeneous graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of weighted and unweighted \(\#\)CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partition functions / 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: Complexity of Counting CSP with Complex Weights / 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: Nonnegative Weighted #CSP: An Effective Complexity Dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: FKT is not universal -- a planar holant dichotomy for symmetric constraints / 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: Holant problems and counting CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect commuting-operator strategies for linear system games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113690 / 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: Holographic algorithms on bases of rank 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On blockwise symmetric matchgate signatures and higher domain \#CSP / 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: A dichotomy for bounded degree graph homomorphisms with nonnegative weights / 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: Q4902474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / 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: Operations with structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlocal games and quantum permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Homomorphisms for Quantum Players / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Morita theory of quantum graph isomorphisms / 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: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Tutte Invariants for Planar Graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130994387 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:52, 9 December 2024

scientific article; zbMATH DE number 7844671
Language Label Description Also known as
English
The complexity of counting planar graph homomorphisms of domain size 3
scientific article; zbMATH DE number 7844671

    Statements

    The complexity of counting planar graph homomorphisms of domain size 3 (English)
    0 references
    0 references
    0 references
    8 May 2024
    0 references
    complexity dichotomy
    0 references
    non-Boolean domain
    0 references
    planar graph homomorphism
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers