Pages that link to "Item:Q2706139"
From MaRDI portal
The following pages link to The Approximability of Constraint Satisfaction Problems (Q2706139):
Displayed 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)
- 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)
- Approximability of clausal constraints (Q970111) (← links)
- A note on some collapse results of valued constraints (Q987814) (← links)
- Resolution for Max-SAT (Q1028942) (← 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)
- Robustly Solvable Constraint Satisfaction Problems (Q2817797) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints (Q2947024) (← links)
- Constraint Satisfaction Parameterized by Solution Size (Q3012823) (← links)
- Approximability of the Maximum Solution Problem for Certain Families of Algebras (Q3392956) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- Two Edge Modification Problems without Polynomial Kernels (Q3656868) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- (Q5091252) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Bounded Tree-Width and CSP-Related Problems (Q5387797) (← links)
- Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- The Next Whisky Bar (Q5740176) (← links)
- (Q5743434) (← links)
- (Q5863854) (← links)
- (Q5874535) (← links)
- (Q5875468) (← links)