Resolution cannot polynomially simulate compressed-BFS (Q1776193): Difference between revisions

@@ Property / cites work @@
+Q5715680
@@ Property / cites work: Q5715680 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871748
@@ Property / cites work: Q4871748 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723442
@@ Property / cites work: Q2723442 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-level logic minimization: an overview
@@ Property / cites work: Two-level logic minimization: an overview / rank @@
+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 @@
+An experimental study of a compressed index
@@ Property / cites work: An experimental study of a compressed index / rank @@
+Normal rank
@@ Property / cites work @@
+Resolution and binary decision diagrams cannot simulate each other polynomially
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Investigations on autark assignments
@@ Property / cites work: Investigations on autark assignments / rank @@
+Normal rank
@@ Property / cites work @@
+GRASP: a search algorithm for propositional satisfiability
+Normal rank
@@ Property / cites work @@
+Q4707784
@@ Property / cites work: Q4707784 / rank @@
+Normal rank