The complexity of Boolean formula minimization (Q619911)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of Boolean formula minimization
scientific article

    Statements

    The complexity of Boolean formula minimization (English)
    0 references
    0 references
    0 references
    18 January 2011
    0 references
    0 references
    formula minimization
    0 references
    computational complexity
    0 references
    logic synthesis
    0 references
    polynomial-time hierarchy
    0 references
    Turing reduction
    0 references
    0 references
    0 references