Complexity of Partial Satisfaction (Q3906440)

From MaRDI portal
Revision as of 13:08, 20 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(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

    Complexity of Partial Satisfaction (English)
    0 references
    0 references
    0 references
    1981
    0 references
    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