On the complexity of resolution with bounded conjunctions (Q1885907)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of resolution with bounded conjunctions
scientific article

    Statements

    On the complexity of resolution with bounded conjunctions (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2004
    0 references
    resolution
    0 references
    complexity of Proofs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers