Pages that link to "Item:Q430830"
From MaRDI portal
The following pages link to Satisfiability, branch-width and Tseitin tautologies (Q430830):
Displayed 25 items.
- Backdoors to q-Horn (Q261394) (← links)
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- On the hierarchical community structure of practical Boolean formulas (Q2118321) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- On the satisfiability of quantum circuits of small treewidth (Q2411047) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space (Q2817796) (← links)
- A SAT Approach to Branchwidth (Q2818011) (← links)
- An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)
- On the Satisfiability of Quantum Circuits of Small Treewidth (Q3194714) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5902141) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
