Is constraint satisfaction over two variables always easy? (Q3156915)

From MaRDI portal
Revision as of 19:33, 12 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q293456)
scientific article
Language Label Description Also known as
English
Is constraint satisfaction over two variables always easy?
scientific article

    Statements

    title
    Is constraint satisfaction over two variables always easy? (English)
    0 references
    author
    Lars Engebretsen
    0 references
    publication date
    12 January 2005
    0 references
    zbMATH Keywords
    Not-All-Equal Sat
    0 references

    Identifiers

    DOI
    10.1002/rsa.20026
    0 references
    Mathematics Subject Classification ID
    68T20
    0 references
    68Q17
    0 references
    68Q25
    0 references
    68W25
    0 references
    zbMATH DE Number
    2126606
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3156915&oldid=20866285"
    Powered by MediaWiki