Pages that link to "Item:Q1917076"

The following pages link to Complexity of generalized satisfiability counting problems (Q1917076):

Displaying 36 items.

• Complexity of tiling a polygon with trominoes or bars (Q2411829) (← links)
• Predecessor existence problems for finite discrete dynamical systems (Q2455591) (← links)
• Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
• Itemset frequency satisfiability: complexity and axiomatization (Q2481978) (← links)
• Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
• The complexity of partition functions (Q2581263) (← links)
• A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
• The complexity of counting homomorphisms to cactus graphs modulo 2 (Q2828223) (← links)
• Counting Minimal Dominating Sets (Q2988832) (← links)
• Unique Perfect Phylogeny Is NP-Hard (Q3011849) (← links)
• A Dichotomy Theorem for Polynomial Evaluation (Q3182924) (← links)
• Merge-and-Shrink Abstraction (Q3189651) (← links)
• The Fewest Clues Problem of Picross 3D (Q3301015) (← links)
• Organization mechanism and counting algorithm on vertex-cover solutions (Q3302224) (← links)
• Complexity of Counting the Optimal Solutions (Q3511323) (← links)
• Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
• Horn representation of a concept lattice (Q3631392) (← links)
• A Complexity Index for Satisfiability Problems (Q4286227) (← links)
• Complexity of satisfiability problems with symmetric polynomial clauses (Q4344698) (← links)
• On generating all solutions of generalized satisfiability problems (Q4389761) (← links)
• The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
• (Q4955353) (← links)
• On the Complexity of Holant Problems (Q4993599) (← links)
• Counting Constraint Satisfaction Problems. (Q4993601) (← links)
• Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
• A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
• (Q5092397) (← links)
• (Q5092423) (← links)
• Classification of a Class of Counting Problems Using Holographic Reductions (Q5323095) (← links)
• An Algebraic Characterization of Testable Boolean CSPs (Q5326555) (← links)
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
• Approximate Counting via Correlation Decay in Spin Systems (Q5743448) (← links)
• (Q5863854) (← links)
• The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)
• Generalized satisfiability problems via operator assignments (Q5919560) (← links)
• Exponential time complexity of the complex weighted Boolean \#CSP (Q6591459) (← links)