Complexity of Partial Satisfaction (Q3906440)

From MaRDI portal
Revision as of 20:38, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Complexity of Partial Satisfaction
scientific article

    Statements

    title
    Complexity of Partial Satisfaction (English)
    0 references
    author
    Karl J. Lieberherr
    0 references
    Ernst Specker
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    doubly transitive permutations
    0 references
    golden mean
    0 references
    NP-complete
    0 references
    polynomial enumeration algorithm
    0 references
    polynomially constructive reductions
    0 references
    satisfiability
    0 references

    Identifiers

    DOI
    10.1145/322248.322260
    0 references
    zbMATH DE Number
    3714958
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3906440&oldid=17560885"
    Powered by MediaWiki