Pages that link to "Item:Q2706139"
From MaRDI portal
The following pages link to The approximability of constraint satisfaction problems (Q2706139):
Displaying 28 items.
- 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)
- (Q4250183) (← links)
- A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction (Q4526965) (← links)
- Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. (Q4608591) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Some recent strong inapproximability results (Q5054856) (← 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)
- (Q5365140) (← links)
- Bounded Tree-Width and CSP-Related Problems (Q5387797) (← links)
- Some optimal inapproximability results (Q5441360) (← 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)
- Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
- On approximability of satisfiable <i>k</i> -CSPs: I (Q6083552) (← links)