Solving SCS for bounded length strings in fewer than $2^n$ steps (Q2448115): Difference between revisions

@@ Property / cites work @@
+A finite-difference sieve to count paths and cycles by length
+Normal rank
@@ Property / cites work @@
+-coloring in time
@@ Property / cites work: 3-coloring in time / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Treatment of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+The Travelling Salesman Problem in Bounded Degree Graphs
+Normal rank
@@ Property / cites work @@
+Trimmed Moebius inversion and graphs of bounded degree
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
+Normal rank
@@ Property / cites work @@
+An algorithm for the Rural Postman problem on a directed graph
+Normal rank
@@ Property / cites work @@
+Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree
+Normal rank
@@ Property / cites work @@
+MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
+Normal rank
@@ Property / cites work @@
+On finding minimal length superstrings
@@ Property / cites work: On finding minimal length superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Solving 3-Superstring in 3 n/3 Time
@@ Property / cites work: Solving 3-Superstring in 3 n/3 Time / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General
+Normal rank
@@ Property / cites work @@
+Dynamic programming meets the principle of inclusion and exclusion
+Normal rank
@@ Property / cites work @@
+Optimal 2-constraint satisfaction via sum-product algorithms
+Normal rank
@@ Property / cites work @@
+New upper bounds for the problem of maximal satisfiability
+Normal rank
@@ Property / cites work @@
+A full derandomization of schöning's k-SAT algorithm
+Normal rank
@@ Property / cites work @@
+Lyndon Words and Short Superstrings
@@ Property / cites work: Lyndon Words and Short Superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic algorithm for \(k\)-SAT based on limited local search and restart
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for optimal 2-constraint satisfaction and its implications
+Normal rank

Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115): Difference between revisions

Latest revision as of 11:51, 8 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)