Complexity of Partial Satisfaction (Q3906440)

From MaRDI portal
Revision as of 00:21, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of Partial Satisfaction
scientific article

    Statements

    title
    Complexity of Partial Satisfaction (English)
    0 references
    DOI
    10.1145/322248.322260
    0 references
    author
    Karl J. Lieberherr
    0 references
    Ernst Specker
    0 references
    publication date
    1981
    0 references
    zbMATH DE Number
    3714958
    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
    OpenAlex ID
    W2005180798
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3906440&oldid=32367494"
    Powered by MediaWiki