A computational proof of complexity of some restricted counting problems (Q534558)

From MaRDI portal
Revision as of 00:33, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A computational proof of complexity of some restricted counting problems
scientific article

    Statements

    title
    A computational proof of complexity of some restricted counting problems (English)
    0 references
    author
    Jin-Yi Cai
    0 references
    Pinyan Lu
    0 references
    Mingji Xia
    0 references
    publication date
    18 May 2011
    0 references
    zbMATH Keywords
    Holant problem
    0 references
    holographic reduction
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C22
    0 references
    68-04
    0 references
    zbMATH DE Number
    5895903
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q534558&oldid=25638938"
    Powered by MediaWiki