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

@@ Property / DOI @@
-.1016/j.ipl.2012.03.009
@@ Property / DOI: 10.1016/j.ipl.2012.03.009 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2012.03.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2009304285
@@ Property / OpenAlex ID: W2009304285 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+On the automatizability of resolution and related propositional proof systems
+Normal rank
@@ Property / cites work @@
+Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
+Normal rank
@@ Property / cites work @@
+Q5715680
@@ Property / cites work: Q5715680 / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning
+Normal rank
@@ Property / cites work @@
+Q3800030
@@ Property / cites work: Q3800030 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards NP-P via proof complexity and search
@@ Property / cites work: Towards NP-P via proof complexity and search / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133141
@@ Property / cites work: Q4133141 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5306365
@@ Property / cites work: Q5306365 / rank @@
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856172
@@ Property / cites work: Q4856172 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5694881
@@ Property / cites work: Q5694881 / rank @@
+Normal rank
@@ Property / cites work @@
+An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams
+Normal rank
@@ Property / cites work @@
+Propositional proof systems, the consistency of first order theories and the complexity of computations
+Normal rank
@@ Property / cites work @@
+Q3689182
@@ Property / cites work: Q3689182 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4215637
@@ Property / cites work: Q4215637 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2012.03.009
@@ Property / DOI: 10.1016/J.IPL.2012.03.009 / rank @@
+Normal rank