On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems (Q2706120)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
scientific article

    Statements

    On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    resolution
    0 references
    cutting planes proof system
    0 references
    computational complexity
    0 references
    proof complexity
    0 references
    circuit complexity
    0 references