Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698): Difference between revisions

@@ Property / cites work @@
+Satisfiability, branch-width and Tseitin tautologies
+Normal rank
@@ Property / cites work @@
+Q2741535
@@ Property / cites work: Q2741535 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Q4942157
@@ Property / cites work: Q4942157 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the bandwidth via volume respecting embeddings
+Normal rank
@@ Property / cites work @@
+On powers of graphs of bounded NLC-width (clique-width)
+Normal rank
@@ Property / cites work @@
+Complexity Results for Bandwidth Minimization
@@ Property / cites work: Complexity Results for Bandwidth Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity in AI and nonmonotonic reasoning
+Normal rank
@@ Property / cites work @@
+Q4228486
@@ Property / cites work: Q4228486 / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Solving #SAT Using Vertex Covers
@@ Property / cites work: Solving #SAT Using Vertex Covers / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+On uniform circuit complexity
@@ Property / cites work: On uniform circuit complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction with Bounded Treewidth Revisited
+Normal rank
@@ Property / cites work @@
+Algorithms for Propositional Model Counting
@@ Property / cites work: Algorithms for Propositional Model Counting / rank @@
+Normal rank
@@ Property / cites work @@
+Bandwidth of the complete \(k\)-ary tree
@@ Property / cites work: Bandwidth of the complete \(k\)-ary tree / rank @@
+Normal rank
@@ Property / cites work @@
+On the Tape Complexity of Deterministic Context-Free Languages
+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 @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Parallel Computation of Polynomials Using Few Processors
+Normal rank