Algorithms for four variants of the exact satisfiability problem (Q596105): 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.tcs.2004.02.035
+Normal rank
@@ Property / OpenAlex ID @@
+W2089328544
@@ Property / OpenAlex ID: W2089328544 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252376
@@ Property / cites work: Q4252376 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4256519
@@ Property / cites work: Q4256519 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828946
@@ Property / cites work: Q4828946 / rank @@
+Normal rank
@@ Property / cites work @@
+A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
+Normal rank
@@ Property / cites work @@
+Algorithms for Sat and upper bounds on their complexity
+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 @@
+Q4938786
@@ Property / cites work: Q4938786 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster exact solutions for some NP-hard problems.
@@ Property / cites work: Faster exact solutions for some NP-hard problems. / rank @@
+Normal rank
@@ Property / cites work @@
+Counting the number of solutions for instances of satisfiability
+Normal rank
@@ Property / cites work @@
+Q2768314
@@ Property / cites work: Q2768314 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Unlabelled Subtrees of a Tree is #P-complete
+Normal rank
@@ Property / cites work @@
+The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+Q4736839
@@ Property / cites work: Q4736839 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Planar Counting Problems
@@ Property / cites work: The Complexity of Planar Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem
+Normal rank
@@ Property / cites work @@
+New methods for 3-SAT decision and worst-case analysis
+Normal rank
@@ Property / cites work @@
+An improved exponential-time algorithm for             <i>k</i>             -SAT
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximate reasoning
@@ Property / cites work: On the hardness of approximate reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+Q3851094
@@ Property / cites work: Q3851094 / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic algorithm for \(k\)-SAT based on limited local search and restart
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+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