NP-completeness of a combinator optimization problem (Q1903594)

From MaRDI portal
scientific article
Language Label Description Also known as
English
NP-completeness of a combinator optimization problem
scientific article

    Statements

    NP-completeness of a combinator optimization problem (English)
    0 references
    0 references
    0 references
    13 May 1996
    0 references
    deterministic rewrite system
    0 references
    combinatory logic
    0 references
    normal form
    0 references
    lambda- expression
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references