On tseitin formulas, read-once branching programs and treewidth (Q2043884): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-020-10007-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2954150872
@@ Property / OpenAlex ID: W2954150872 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability, branch-width and Tseitin tautologies
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+Q5121904
@@ Property / cites work: Q5121904 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Bounds for the Grid-Minor Theorem
@@ Property / cites work: Polynomial Bounds for the Grid-Minor Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Excluded Grid Theorem
@@ Property / cites work: Excluded Grid Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth in Verification: Local vs. Global
@@ Property / cites work: Treewidth in Verification: Local vs. Global / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs
+Normal rank
@@ Property / cites work @@
+Cops-robber games and the resolution of Tseitin formulas
+Normal rank
@@ Property / cites work @@
+Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs.
+Normal rank
@@ Property / cites work @@
+On Tseitin formulas, read-once branching programs and treewidth
+Normal rank
@@ Property / cites work @@
+Improved bounds on the planar branchwidth with respect to the largest grid minor size
+Normal rank
@@ Property / cites work @@
+On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables
+Normal rank
@@ Property / cites work @@
+Tree-width, path-width, and cutwidth
@@ Property / cites work: Tree-width, path-width, and cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856172
@@ Property / cites work: Q4856172 / rank @@
+Normal rank
@@ Property / cites work @@
+Search Problems in the Decision Tree Model
@@ Property / cites work: Search Problems in the Decision Tree Model / rank @@
+Normal rank
@@ Property / cites work @@
+On the read-once property of branching programs and CNFs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5593816
@@ Property / cites work: Q5593816 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard examples for resolution
@@ Property / cites work: Hard examples for resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank