Pages that link to "Item:Q2566034"

The following pages link to Subtractive reductions and complete problems for counting complexity classes (Q2566034):

Displaying 30 items.

• The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
• Tractable counting of the answers to conjunctive queries (Q389242) (← links)
• The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
• Bernoulli measure on strings, and Thompson-Higman monoids. (Q766121) (← links)
• Counting minimal unsatisfiable subsets (Q832272) (← links)
• Complexity of counting the optimal solutions (Q837174) (← links)
• On the counting complexity of propositional circumscription (Q963360) (← links)
• Counting complexity of propositional abduction (Q988576) (← links)
• Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
• The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
• The complexity of problems for quantified constraints (Q1959381) (← links)
• Handling and measuring inconsistency in non-monotonic logics (Q2211858) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
• A complexity theory for hard enumeration problems (Q2274092) (← links)
• Definability for model counting (Q2303508) (← links)
• On the complexity of inconsistency measurement (Q2321337) (← links)
• The effect of combination functions on the complexity of relational Bayesian networks (Q2409113) (← links)
• Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
• On the Complexity of Query Result Diversification (Q2790132) (← links)
• THE THOMPSON–HIGMAN MONOIDS M_k,i: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY (Q2996837) (← links)
• Complexity of Counting the Optimal Solutions (Q3511323) (← links)
• Counting Complexity of Minimal Cardinality and Minimal Weight Abduction (Q3532468) (← links)
• (Q5216300) (← links)
• On the Complexity of Computing Generators of Closed Sets (Q5445331) (← links)
• Decision Procedures for Multisets with Cardinality Constraints (Q5452719) (← links)
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
• The Weight in Enumeration (Q5738998) (← links)
• Default logic and bounded treewidth (Q5918613) (← links)
• Parameterised counting in logspace (Q6093373) (← links)