The complexity of counting planar graph homomorphisms of domain size 3 (Q6499302)

From MaRDI portal
Revision as of 11:52, 9 December 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q130994387, #quickstatements; #temporary_batch_1733741289228)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    The complexity of counting planar graph homomorphisms of domain size 3 (English)
    0 references
    author
    Jin-Yi Cai
    0 references
    Ashwin Maran
    0 references
    publication date
    8 May 2024
    0 references
    zbMATH Keywords
    complexity dichotomy
    0 references
    non-Boolean domain
    0 references
    planar graph homomorphism
    0 references
    cites work
    Q5002678
    0 references
    Q5690490
    0 references
    Q4952624
    0 references
    Q3113690
    0 references
    Q4902474
    0 references
    Q3222326
    0 references
    Q5605168
    0 references
    Q4899293
    0 references
    Holographic Algorithms
    0 references

    Identifiers

    zbMATH DE Number
    7844671
    0 references
    Wikidata QID
    Q130994387
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6499302&oldid=38271512"
    Powered by MediaWiki