Pages that link to "Item:Q960525"

The following pages link to A dichotomy theorem for maximum generalized satisfiability problems. (Q960525):

Displaying 28 items.

• Complexity versus stability for classes of propositional formulas (Q293437) (← links)
• On the Boolean connectivity problem for Horn relations (Q608293) (← links)
• On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
• Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
• Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
• Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
• The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
• The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
• Selecting and covering colored points (Q1801049) (← links)
• Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
• The complexity of minimal satisfiability problems (Q1887137) (← links)
• PCPs and the hardness of generating synthetic data (Q2210447) (← links)
• Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems (Q2254494) (← links)
• Isomorphic implication (Q2272203) (← links)
• Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
• Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
• Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
• Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
• The complexity of soft constraint satisfaction (Q2457608) (← links)
• (Q2741527) (← links)
• Complexity Classification of Local Hamiltonian Problems (Q2799351) (← links)
• Backdoor Sets for CSP. (Q4993598) (← links)
• Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
• The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
• (Q5874535) (← links)