Pages that link to "Item:Q2706139"

The following pages link to The approximability of constraint satisfaction problems (Q2706139):

Displaying 50 items.

• Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
• On the Boolean connectivity problem for Horn relations (Q608293) (← links)
• Efficient multiple constraint acquisition (Q823769) (← links)
• Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
• Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← 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)
• A dichotomy theorem for maximum generalized satisfiability problems. (Q960525) (← links)
• Approximability of clausal constraints (Q970111) (← links)
• A note on some collapse results of valued constraints (Q987814) (← links)
• Resolution for Max-SAT (Q1028942) (← links)
• Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
• Approximating satisfiable satisfiability problems (Q1578395) (← links)
• An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
• 2 CSPs all are approximable within a constant differential factor (Q1661912) (← links)
• On the complexity of trial and error for constraint satisfaction problems (Q1678168) (← links)
• Affine reductions for LPs and SDPs (Q1717229) (← 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)
• On the Hamming distance of constraint satisfaction problems. (Q1853512) (← links)
• The complexity of minimal satisfiability problems (Q1887137) (← links)
• On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
• Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
• PCPs and the hardness of generating synthetic data (Q2210447) (← links)
• The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
• Isomorphic implication (Q2272203) (← links)
• Minimal distance of propositional models (Q2322705) (← links)
• Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
• A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
• Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
• Approximation of the quadratic set covering problem (Q2427697) (← links)
• The complexity of soft constraint satisfaction (Q2457608) (← links)
• The satisfiability constraint gap (Q2674178) (← links)
• Robustly solvable constraint satisfaction problems (Q2817797) (← links)
• Universal Factor Graphs (Q2843260) (← links)
• On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems (Q2851846) (← links)
• Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
• Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set (Q2913811) (← links)
• Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
• Near-optimal algorithms for maximum constraint satisfaction problems (Q2930257) (← links)
• (Q2934583) (← links)
• Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints (Q2947024) (← links)
• Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889) (← links)
• Complexity of approximating CSP with balance / hard constraints (Q2988897) (← links)
• Constraint Satisfaction Parameterized by Solution Size (Q3012823) (← links)
• Limit Behavior of Locally Consistent Constraint Satisfaction Problems (Q3094950) (← links)
• Approximate Constraint Satisfaction Requires Large LP Relaxations (Q3177811) (← links)
• Approximability of the Maximum Solution Problem for Certain Families of Algebras (Q3392956) (← links)
• Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)