Completeness and weak completeness under polynomial-size circuits (Q1917077)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Completeness and weak completeness under polynomial-size circuits
scientific article

    Statements

    Completeness and weak completeness under polynomial-size circuits (English)
    0 references
    0 references
    0 references
    2 January 1997
    0 references
    nonuniform complexity of problems
    0 references
    weakly P/Poly-Turing-complete problems
    0 references

    Identifiers