New algorithms for exact satisfiability (Q1770407): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2004.12.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2034758366
@@ Property / OpenAlex ID: W2034758366 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for four variants of the exact satisfiability problem
+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 @@
+An upper bound \(O(2^{0.16254n})\) for exact 3-satisfiability: a simpler proof
+Normal rank
@@ Property / cites work @@
+Q4747916
@@ Property / cites work: Q4747916 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\)
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
+Normal rank