New upper bound for the \#3-SAT problem (Q2380029): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2007.06.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2042764910
@@ Property / OpenAlex ID: W2042764910 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4808676
@@ Property / cites work: Q4808676 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting models for 2SAT and 3SAT formulae
@@ Property / cites work: Counting models for 2SAT and 3SAT formulae / 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 @@
+Counting the number of solutions for instances of satisfiability
+Normal rank
@@ Property / cites work @@
+New methods for 3-SAT decision and worst-case analysis
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Number of models and satisfiability of sets of clauses
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2380029