Pages that link to "Item:Q5325861"

The following pages link to Theory and Applications of Satisfiability Testing (Q5325861):

Displaying 32 items.

• An enumerative algorithm for \#2SAT (Q283678) (← links)
• Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
• Consequence-based and fixed-parameter tractable reasoning in description logics (Q490523) (← links)
• Connecting knowledge compilation classes and width parameters (Q778533) (← links)
• On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
• Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
• A note on width-parameterized SAT: an exact machine-model characterization (Q990090) (← links)
• Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
• On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
• Backdoors for linear temporal logic (Q1725638) (← links)
• Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
• Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
• Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
• Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
• Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
• On efficiently solvable cases of quantum \(k\)-SAT (Q2223725) (← links)
• Succinct certification of monotone circuits (Q2232601) (← links)
• New width parameters for SAT and \#SAT (Q2238644) (← links)
• Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
• Paradigms for parameterized enumeration (Q2398214) (← links)
• Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
• Visualizing SAT instances and runs of the DPLL algorithm (Q2462641) (← links)
• Solving \#SAT using vertex covers (Q2464035) (← links)
• Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
• Strong Backdoors for Default Logic (Q2818000) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• Small Resolution Proofs for QBF using Dependency Treewidth (Q3304126) (← links)
• Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
• Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
• (Q5005139) (← links)
• (Q5090465) (← links)
• SAT backdoors: depth beats size (Q6152185) (← links)