Davis-Putnam resolution versus unrestricted resolution (Q1353991): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution proofs of generalized pigeonhole principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of regular resolution and the Davis-Putnam procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrestricted resolution versus N-resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank

Latest revision as of 12:25, 27 May 2024

scientific article
Language Label Description Also known as
English
Davis-Putnam resolution versus unrestricted resolution
scientific article

    Statements

    Davis-Putnam resolution versus unrestricted resolution (English)
    0 references
    0 references
    0 references
    13 May 1997
    0 references
    0 references
    proofs of superpolynomial length
    0 references
    Davis-Putnam resolution
    0 references
    unsatisfiable propositional formulas
    0 references
    unrestricted resolution proofs
    0 references