Computational complexity of some restricted instances of 3-SAT (Q875598)

From MaRDI portal
Revision as of 16:35, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computational complexity of some restricted instances of 3-SAT
scientific article

    Statements

    title
    Computational complexity of some restricted instances of 3-SAT (English)
    0 references
    author
    Piotr Berman
    0 references
    Marek Karpinski
    0 references
    Alexander D. Scott
    0 references
    publication date
    13 April 2007
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    68Q25
    0 references
    68T20
    0 references
    zbMATH DE Number
    5142435
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q875598&oldid=12822287"
    Powered by MediaWiki