The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091)

From MaRDI portal
Revision as of 10:22, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
scientific article

    Statements

    title
    The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (English)
    0 references
    author
    Nadia Creignou
    0 references
    publication date
    28 February 1997
    0 references
    zbMATH Keywords
    satisfiability
    0 references

    Identifiers

    zbMATH DE Number
    985369
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q673091&oldid=34176677"
    Powered by MediaWiki