The complexity of approximating conservative counting CSPs. (Q2957879)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of approximating conservative counting CSPs.
scientific article

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 January 2017
    0 references
    counting constraint satisfaction problem
    0 references
    approximation
    0 references
    complexity
    0 references
    The complexity of approximating conservative counting CSPs. (English)
    0 references

    Identifiers