A note on SAT algorithms and proof complexity (Q436581): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the automatizability of resolution and related propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards NP-P via proof complexity and search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306365 / 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 machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5694881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional proof systems, the consistency of first order theories and the complexity of computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215637 / rank
 
Normal rank

Latest revision as of 12:36, 5 July 2024

scientific article
Language Label Description Also known as
English
A note on SAT algorithms and proof complexity
scientific article

    Statements

    A note on SAT algorithms and proof complexity (English)
    0 references
    0 references
    25 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    SAT algorithms
    0 references
    0 references