Pages that link to "Item:Q2723175"

The following pages link to Complexity classifications of Boolean constraint satisfaction problems (Q2723175):

Displaying 50 items.

• A dichotomy for real weighted Holant problems (Q260401) (← links)
• The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
• Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (Q299048) (← links)
• Modularity-based decompositions for valued CSP (Q353312) (← links)
• The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
• On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
• The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
• Colouring, constraint satisfaction, and complexity (Q458466) (← links)
• An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
• Boolean max-co-clones (Q494629) (← links)
• A computational proof of complexity of some restricted counting problems (Q534558) (← links)
• Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
• Combinatorial sharpness criterion and phase transition classification for random CSPs (Q598196) (← links)
• Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
• On the Boolean connectivity problem for Horn relations (Q608293) (← links)
• Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
• Trichotomies in the complexity of minimal inference (Q692908) (← links)
• On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
• Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
• The expressive rate of constraints (Q812391) (← links)
• Periodic constraint satisfaction problems: Tractable subclasses (Q816674) (← links)
• \(H\)-coloring dichotomy revisited (Q817769) (← links)
• Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
• Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
• The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)
• The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
• An upper (lower) bound for Max (Min) CSP (Q893727) (← links)
• The complexity of equality constraint languages (Q929295) (← links)
• Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
• The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
• The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• Approximability of clausal constraints (Q970111) (← links)
• An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
• CSP duality and trees of bounded pathwidth (Q986555) (← links)
• A note on some collapse results of valued constraints (Q987814) (← links)
• Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
• Existentially restricted quantified constraint satisfaction (Q1013082) (← links)
• The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• Relatively quantified constraint satisfaction (Q1020500) (← links)
• A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
• Bases for Boolean co-clones (Q1044708) (← links)
• Generalized satisfiability problems: Minimal elements and phase transitions. (Q1401338) (← links)
• Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
• Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)